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;
int n;
char s[300010];
int nx[300010], a[300010];
int main() {
  while (scanf("%s", s + 1) != EOF) {
    n = strlen(s + 1);
    int nxx[2] = {n + 1, n + 1};
    for (int i = n; i >= 1; --i) {
      nx[i] = nxx[s[i] - '0'];
      nxx[s[i] - '0'] = i;
    }
    memset(a, 0, sizeof a);
    long long res = 0;
    for (int i = 1; i <= n; ++i) {
      int it = nx[i];
      while (it <= n) {
        int nnx = it + it - i;
        if (nnx > n) {
          break;
        }
        if (s[nnx] == s[i]) {
          a[i] = (n - nnx + 1);
          break;
        }
        it = nx[it];
      }
    }
    for (int i = n; i >= 1; --i) {
      a[i] = max(a[i], a[i + 1]);
      res += a[i];
    }
    printf("%lld\n", res);
  }
  return 0;
}