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 bisect

s = input()
n = len(s)
ans = 0
ptn = [[0]*(n+1) for i in range(4)]

for i in range(1, 5):
    for j in range(n):
        if j+2*i >= n:
            break
        if s[j] == s[j+i] and s[j+i] == s[j+2*i]:
            ptn[i-1][j+1] = 1
    for j in range(n):
        ptn[i-1][j+1] += ptn[i-1][j]
        
ans = 0
for l in range(n):
    tmp_ans = 1000000
    for i in range(4):
        tmp = bisect.bisect_left(ptn[i], ptn[i][l]+1)
        tmp_ans = min(tmp_ans, tmp-1+2*(i+1))
    ans += max(0, n - tmp_ans)
print(ans)