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>
using namespace std;
const int inf = 1e9 + 7;
char s[300008];
int n, a[300008];
long long ans;
int main() {
  scanf("%s", s);
  n = strlen(s);
  a[n] = inf;
  for (int i = n - 1; i >= 0; i--) {
    a[i] = a[i + 1];
    for (int j = 1; j <= 4; j++)
      if (i + 2 * j < n)
        if (s[i] == s[i + j] && s[i + j] == s[i + 2 * j]) {
          a[i] = min(a[i + 1], i + 2 * j);
          break;
        }
  }
  for (int i = 0; i < n; i++)
    if (a[i] <= n) ans = ans + 1ll * (n - a[i]);
  printf("%lld\n", ans);
  return 0;
}