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:
from collections import defaultdict as dd
import math
def nn():
	return int(input())

def li():
	return list(input())

def mi():
	return map(int, input().split())

def lm():
	return list(map(int, input().split()))

s=li()
n=len(s)
total=0

def testsub(sub):
	for k in range(1,(len(sub)-1)//2+1):
			#print(k)
			if sub[0]==sub[k] and sub[k]==sub[2*k]:
				#print(len(sli))
				#print('true')				
				return True

	return False

for i in range(len(s)):
	r=n	
	lets=3
	
	done=0
	while i+lets<=len(s):
		
		sli=s[i:i+lets]
		for m in range(0,len(sli)-2):
			#print(sli[m:])
			if testsub(sli[m:]):
				done=1
				break
		if done==1:
			r=i+len(sli)-1
			break
		
		lets+=1
	#print(total,r)	
	total+=n-r


print(total)