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.util.Arrays;

public class Main {
	static int inf = 1000000000;
	static int MOD = 1000000007;
	public static void main(String ards[])
	{
		Scanner cin = new Scanner(System.in);
        String s1 = cin.next();
        StringBuilder str = new StringBuilder(" ");
        str.append(s1);
        int len = str.length();
        String s = str.toString();
        int p = 0;
        long ans = 0;
        for(int i = 3; i < len; i++){
            for(int j = p+1; j <= i-2; j++){
                if((i-j)%2 == 0 && s.charAt(i) == s.charAt(j) && s.charAt(i) == s.charAt((i+j)/2)) p = j;
            }
            ans+=p;
        } 
        
        System.out.println(ans);
	}
}