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
S = sys.stdin.readline()
S = S.strip()

n = len(S)
ans = 0

def check(i, j) :
    if j - i < 3 :
        return False
    for x in range(i, j) :
        for k in range(1, j - i) :
            if x + 2 * k >= j :
                break
            if S[x] == S[x+k] == S[x + 2 * k] :
                return True

    return False

for i in range(n) :
    for j in range(i + 1, min(i + 100, n+1)) :
        if check(i, j) :
            ans += n - j + 1
            break

print(ans)