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;
vector<pair<long long, long long> > val;
int v[2][300005], vf[2];
bool inv[300005];
int main() {
  string s;
  long long ans, l, ind, i, n, r;
  int ch, j;
  ios_base::sync_with_stdio(false);
  cin >> s;
  n = s.size();
  ans = 0;
  l = -1;
  for (i = 0; i < n; i++) {
    ch = s[i] - '0';
    v[ch][++vf[ch]] = i;
    for (j = vf[ch] - 1; j >= 1; j--) {
      ind = v[ch][j];
      if (ind <= l) break;
      ind = i - ind;
      if (i + ind >= n) break;
      if (s[i + ind] - '0' == ch) {
        val.push_back({i - ind, i + ind});
        l = i - ind;
        break;
      }
    }
  }
  ans = 0;
  sort(val.begin(), val.end());
  r = -1;
  for (i = 0; i < val.size(); i++) {
    if (val[i].second < r) {
      j = i - 1;
      while (j >= 0 && val[j].second > val[i].second) {
        inv[j] = 1;
        j--;
      }
    }
    r = val[i].second;
  }
  ans = 0;
  l = -1;
  for (i = 0; i < val.size(); i++) {
    if (inv[i]) continue;
    ans += (val[i].first - l) * (n - val[i].second);
    l = val[i].first;
  }
  cout << ans << '\n';
  return 0;
}