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 maxn = 3e5 + 10;
int n, tot;
char a[maxn];
int main() {
  scanf("%s", a + 1);
  n = strlen(a + 1);
  for (int l = 1; l <= n; l++) {
    for (int j = 3; j < 20; j++) {
      int r = l + j - 1;
      if (r > n) {
        tot += n - l + 1;
        break;
      }
      bool flg = 0;
      for (int x = l; x < r - 1 && !flg; x++) {
        for (int k = 1; x + k + k <= r; k++) {
          if (a[x] == a[x + k] && a[x + k] == a[x + k + k]) {
            flg = 1;
            break;
          }
        }
      }
      if (flg) {
        tot += r - l;
        break;
      }
    }
  }
  printf("%I64d", 1ll * n * (n + 1) / 2 - tot);
  return 0;
}