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:
s = input()
n = len(s)

ans = 0
X = []

for x in range(n):
    k = 1 
    while x + 2*k < n and (s[x] != s[x+k] or s[x] != s[x+2*k]):
       k += 1
    if x + 2*k < n:
        X += [(x, x + 2*k)]

for i in range(len(X)-2, -1, -1):
    X[i] = (X[i][0], min(X[i][1], X[i+1][1]))

I = 0

if len(X):
    for l in range(n):
        if X[I][0] < l:
            while I < len(X) and X[I][0] < l:
                I += 1
            if I == len(X):
                break
        ans += max(0, n - X[I][1])
print(ans)