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 CPP):

Solution:
#include <bits/stdc++.h>
const int MAX_N = 3e5;
char s[MAX_N + 10];
int l[MAX_N + 10], r[MAX_N + 10];
int main() {
  scanf("%s", s);
  int n = 0, slen = strlen(s);
  l[0] = -1, r[0] = -1;
  for (int right = 0; right < slen; right++)
    for (int k = 1; right - 2 * k > l[n]; k++)
      if (s[right] == s[right - k] && s[right] == s[right - 2 * k])
        l[++n] = right - 2 * k, r[n] = right;
  long long res = 0;
  for (int i = 1; i <= n; i++) res += (l[i] - l[i - 1]) * (slen - r[i]);
  printf("%lld\n", res);
}