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>
const double pi = 4.0 * atan(1.0);
const double e = exp(1.0);
const int maxn = 3e5 + 8;
const long long mod = 1e9 + 7;
const unsigned long long base = 1e7 + 7;
using namespace std;
char s[maxn];
bool check(int l, int r) {
  for (int x = l; x <= r - 2; x++) {
    for (int k = 1; x + 2 * k <= r; k++) {
      if (s[x] == s[x + k] && s[x] == s[x + 2 * k]) {
        return 1;
      }
    }
  }
  return 0;
}
int main() {
  scanf("%s", s);
  long long ans = 0;
  int ls = strlen(s);
  for (int i = 0; s[i]; i++) {
    ans += max(0, ls - i - 10);
    for (int j = i + 2; j < i + 10 && s[j]; j++) {
      if (check(i, j)) {
        ans += min(i + 10, ls) - j;
        break;
      }
    }
  }
  cout << ans << endl;
}