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.*;
//import java.math.BigLongeger; 
public class Boss {
	static long c=0;
	
	private static long INF = (long) 1e9;
	static HashMap<Integer,Integer> g=new HashMap<Integer,Integer>();
	static int x;
	static int y;
	static int z;
	//static HashMap<Integer,Long> hm2=new HashMap<Integer,Long>();
	public static void main(String[] args)
	{
		Scanner sc=new Scanner(System.in);
		String s=sc.nextLine();
		ArrayList<Integer> z=new ArrayList<Integer>();
		ArrayList<Integer> o=new ArrayList<Integer>();
		/*for(int i=0;i<s.length();i++)
			if(s.charAt(i)=='1')
				o.add(i);
			else
				z.add(i);*/
		int n=s.length();
		long ans=0;
		int pre=n;
		int rm=-1;
		int prm=0;
		for(int i=n-3;i>=0;i--)
		{
			for(int k=1;i+2*k<pre;k++)
			{
				if(s.charAt(i)==s.charAt(i+k)&&s.charAt(i)==s.charAt(i+2*k))
					pre=i+2*k;
			}
			ans+=n-pre;
		}
		System.out.print(ans);
	}
}