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
import math
from collections import defaultdict,deque
import heapq
s=sys.stdin.readline()[:-1]
ans=0
n=len(s)
mink=n
for i in range(n-1,-1,-1):
	k=1
	z=True
	while i+2*k<n and z:
		if s[i]==s[i+k]==s[i+2*k]:
			z=False
			continue
		k+=1
	if not z:
		mink=min(mink,i+2*k)
		#print(mink,'mink',i,'i')
	x=n-mink
	ans+=x
		#ans+=(n-(i+2*k))+(i-1)
	#print(ans,'ans',i,'i')
print(ans)