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:
#!/usr/bin/python
import sys
data_string = input()
total_seq = 0
current_end_seq = 0
step = 0
while step < len(data_string)- 1:
    step += 1
    total_seq = total_seq + current_end_seq
    min_d = 1
    while step - 2 * min_d + 1 > current_end_seq:
        if data_string[step] == data_string[step - min_d] == data_string[step - 2 * min_d]:
            current_end_seq = step - 2 * min_d + 1
            break
        min_d += 1
    #print(current_end_seq)
print(total_seq + current_end_seq)