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.io.*;
public class Solution{
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        int n = s.length();
        int[] c = new int[n];
        for(int i=0;i<n;i++){
            if(s.charAt(i)=='0') c[i] = 0;
            else c[i] = 1;
        }
        int end = n;
        
        long resultat = 0;
        for(int i=n-3;i>=0;i--){
            for(int j=i+1;j<end;j++){
                if(j+j-i>=end) break;
                if(c[i]!=c[j]) continue;
                if(c[i]==c[j+j-i]) {
                    end = j+j-i;
                    break;
                }
            }
            resultat += (long)(n-end);
        }
        
        System.out.println(resultat);
        
    }
    
}