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)
sml=(n*(n+1))//2
for i in range(8):
    sml-=max(n-i,0)
good3=set()
good4=set()
good5=set()
good6=set()
good7=set()
for i in range(n-2):
    if s[i]==s[i+1]==s[i+2]:
        good3.add(i)
        sml+=1
for i in range(n-3):
    if i in good3 or i+1 in good3:
        good4.add(i)
        sml+=1
for i in range(n-4):
    if i in good4 or i+1 in good4 or s[i]==s[i+2]==s[i+4]:
        good5.add(i)
        sml+=1
for i in range(n-5):
    if i in good5 or i+1 in good5:
        good6.add(i)
        sml+=1
for i in range(n-6):
    if i in good6 or i+1 in good6 or s[i]==s[i+3]==s[i+6]:
        good7.add(i)
        sml+=1
for i in range(n-7):
    if i in good7 or i+1 in good7:
        sml+=1
print(sml)