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;
bool compareFunc(pair<long long, long long> i1, pair<long long, long long> i2) {
  if (i1.first >= i2.first && i1.second <= i2.second)
    return true;
  else if (i2.first >= i1.first && i2.second <= i1.second)
    return false;
  else if (i2.first > i1.first && i2.second > i1.second)
    return true;
  return false;
}
int main(int argc, char const *argv[]) {
  string s;
  cin >> s;
  long long n = 1ll * s.size();
  long long res = 0;
  vector<pair<long long, long long> > intervals;
  for (long long i = 0; i < n - 2; i++) {
    for (long long k = 1; i + 2 * k < n; k++) {
      if (s[i] == s[i + k] && s[i] == s[i + 2 * k]) {
        intervals.push_back(make_pair(i, i + 2 * k));
        break;
      }
    }
  }
  sort(intervals.begin(), intervals.end(), compareFunc);
  long long curr_l = -1;
  for (int i = 0; i < intervals.size(); i++) {
    if (intervals[i].first <= curr_l) {
      continue;
    }
    res += (intervals[i].first - curr_l) * (n - intervals[i].second);
    curr_l = intervals[i].first;
  }
  cout << res << endl;
  return 0;
}