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.Scanner;

public class D562 {

	@SuppressWarnings("resource")
	public static void main(String[] args){
		Scanner input = new Scanner(System.in);
		char[] nums = input.next().toCharArray();
		int l = nums.length;
		int[] close = new int[l];
		for (int i = 0; i < l; i++){
			close[i] = l;
		}
		for (int x = 0; x < l - 1; x++){
			for (int k = 1; k <= (l - 1 - x) / 2; k++){
				//System.out.println(x + " " + k);
				if (nums[x] == nums[x + k] && nums[x] == nums[x + k + k]){
					close[x] = x + k + k;
					break;
				}
			}
		}
		//System.out.println(Arrays.toString(close));
		int min = l;
		for (int i = l - 2; i >= 0; i--){
			min = Math.min(min, close[i]);
			close[i] = min;
		}
		//System.out.println(Arrays.toString(close));
		long sum = 0;
		for (int n : close){
			sum += l - n;
		}
		System.out.println(sum);
	}

}