Problem: Toad Rash has a binary string s. A binary string consists only of zeros and ones.

Let n be the length of s.

Rash needs to find the number of such pairs of integers l, r that 1 ≤ l ≤ r ≤ n and there is at least one pair of integers x, k such that 1 ≤ x, k ≤ n, l ≤ x < x + 2k ≤ r, and s_x = s_{x+k} = s_{x+2k}.

Find this number of pairs for Rash.

Input

The first line contains the string s (1 ≤ |s| ≤ 300 000), consisting of zeros and ones.

Output

Output one integer: the number of such pairs of integers l, r that 1 ≤ l ≤ r ≤ n and there is at least one pair of integers x, k such that 1 ≤ x, k ≤ n, l ≤ x < x + 2k ≤ r, and s_x = s_{x+k} = s_{x+2k}.

Examples

Input


010101


Output


3


Input


11001100


Output


0

Note

In the first example, there are three l, r pairs we need to count: 1, 6; 2, 6; and 1, 5.

In the second example, there are no values x, k for the initial string, so the answer is 0.

Solution (in PYTHON3):

Solution:
import sys
input=sys.stdin.readline
s=list(input().rstrip())
n=len(s)
for i in range(n):
    s[i]=int(s[i])
ans=n*(n-1)//2 # remove l=r,r=l+1
if n>=2:
    ans-=n-1
for d in range(3,13):
    for i in range(n):
        if i+d>n:
            break
        s1=s[i:i+d]
        flg=False
        for k in range(1,5):
            for st in range(d):
                if st+2*k>=d:
                    break
                if s1[st]==s1[st+k]==s1[st+2*k]:
                    flg=True
                    break
        if not flg:
            ans-=1
print(ans)