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;
template <typename T>
inline T abs(T t) {
  return t < 0 ? -t : t;
}
const long long modn = 1000000007;
inline long long mod(long long x) { return x % modn; }
const int MAXN = 312345;
int n, m, k;
char s[MAXN];
int check(int j) {
  for (int sz = 1; j - sz * 2 >= 0; sz++) {
    if (s[j] == s[j - sz] && s[j] == s[j - 2 * sz]) return sz;
  }
  return 0;
}
int main() {
  scanf(" %s", s);
  n = strlen(s);
  long long ans = 0;
  int i = -1;
  for (int j = 0; j < n; j++) {
    int sz = check(j);
    if (sz) {
      int ni = j - 2 * sz;
      i = max(i, ni);
    }
    ans += i + 1;
  }
  printf("%lld\n", ans);
}