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 Main {
	public static int N;
	public static String str;

	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		str = s.next();
		N = str.length();
		long res = 0;
		for (int i = 0; i < N; i++) {
			for (int c = 3; c <= 9; c++) {
				int j = (i + c - 1);
				if (j >= N)
					break;
				if (check(i, j)) {
					res++;
				}
			}
			if (N - 9 - i >= 0)
				res += N - 9 - i;
		}
		System.out.println(res);
	}

	public static boolean check(int i, int j) {
		for (int x = i; x <= j; x++) {
			for (int k = 1; k <= 4; k++) {
				if (x + k <= j && x + 2 * k <= j) {
					if (str.charAt(x) == str.charAt(x + k) && str.charAt(x) == str.charAt(x + 2 * k)) {
						return true;
					}
				}
			}
		}
		return false;
	}
}