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 long long mod = 1000000007;
const long long INF = mod * mod;
const double eps = 1e-6;
const double pi = acos(-1.0);
void solve() {
  string s;
  cin >> s;
  int n = s.length();
  long long ans = 0;
  if (n > 8) {
    ans += (long long)(n - 8) * (long long)(n - 7) / 2;
  }
  for (int l = 3; l <= 8; l++) {
    if (l > n) break;
    for (int j = 0; j < n - l + 1; j++) {
      bool f = false;
      for (int x = 0; x < l; x++) {
        for (int k = 1; x + 2 * k < l; k++) {
          if (s[j + x] == s[j + x + k] && s[j + x] == s[j + x + 2 * k]) {
            f = true;
          }
        }
      }
      if (f) ans++;
    }
  }
  cout << ans << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}