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 JAVA):

Solution:
import java.util.*;
public class Main {
	static boolean slove(char a,char b,char c)
	{
		if(a==b&&b==c)
			return true;
		else
			return false;
	}
public static void main(String args[])
{
	//System.out.println(1);
	Scanner input=new Scanner(System.in);
	String s=input.next();
	int l=0;int n=s.length();long ans=0;
	//System.out.println(n);
	for(int i=0;i<n;i++)
	{
		for(int j=i;j<n;j++)
		{
			int flag=0;
			for(int k=1;j-(2*k)>=i;k++)
			{
			if(slove(s.charAt(j),s.charAt(j-k),s.charAt(j-2*k)))
			{
				ans+=n-j;
				flag=1;
				break;
			}
			}
			if(flag==1)break;
		}
	}
	System.out.println(ans);
}
}