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:
// https://codeforces.com/blog/entry/67189?#comment-513690
// upsolve with rainboy
import java.io.*;

public class CF1169D {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		char[] cc = br.readLine().toCharArray();
		int n = cc.length;
		boolean[][] dp = new boolean[n][9];
		long cnt = 0;
		for (int k = 3; k < 9; k++)
			for (int i = 0; i + k <= n; i++) {
				boolean good;
				if (k % 2 == 1 && cc[i] == cc[i + k / 2] && cc[i] == cc[i + k - 1])
					good = true;
				else
					good = dp[i][k - 1] || dp[i + 1][k - 1];
				if ((dp[i][k] = good))
					cnt++;
			}
		if (n >= 9)
			cnt += (long) (n - 8) * (n - 7) / 2;
		System.out.println(cnt);
	}
}