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 = 300000;
const int INF = 1000000000;
char a[MAXN + 1];
bool check(int l, int r) {
  assert(r - l + 1 < 10);
  for (int x = l + 1; x + 1 <= r; x++)
    for (int b = 1; x - b >= l && x + b <= r; b++) {
      if (a[x] == a[x - b] && a[x] == a[x + b]) return true;
    }
  return false;
}
int main() {
  int n;
  scanf("%s", a);
  n = strlen(a);
  long long res = 0;
  for (int i = 0; i < n; i++) {
    int r = i;
    while (r < n && !check(i, r)) r++;
    res += n - r;
  }
  printf("%lld\n", res);
  return 0;
}