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:

def get_arr(v):
    ans = []
    while v != 0:
        ans.append(v%2)
        v//=2
    return ans[::-1]


def check_arr(arr):
    for i in range(len(arr)):
        for di in range(1, (len(arr) - i)//2 + 1):
            if i + 2 * di >=len(arr):
                continue
            if arr[i] == arr[i+di] == arr[i + 2 * di]:
                return True
    return False

s = input()


ans = (len(s) * (len(s) + 1)) // 2

for i in range(len(s)):
    for j in range(i+1, min(i + 10, len(s)+1)):
        if not check_arr(s[i:j]):
            ans-=1
print(ans)