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.lang.reflect.Array;
import java.util.Arrays;
import java.util.Scanner;

public class CompetitiveProgramming {
    public static void main(String args[]) {
        Scanner scanner = new Scanner(System.in);
        String string = scanner.nextLine();
        System.out.println(new Solver().goodTriples(string));
        scanner.close();
    }
}
class Solver {
    public long goodTriples(String string) {
        long tot = 0;
        int n = string.length(), pre = n, curr;
        for(int i = n-1;i >= 0;--i) {
            curr = pre;
            for(int k = 1;i+2*k < curr;++k) {
                if(string.charAt(i) == string.charAt(i+k) && string.charAt(i+k) == string.charAt(i+2*k) ) {
                    curr = Math.min(curr, i+2*k);
                    break;
                }
            }
            pre = curr;
            tot += (n-curr);
        }
        return tot;
    }

}