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;
int n;
string st;
long long ans = 0;
vector<pair<int, int>> v;
multiset<int> ms;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> st;
  n = st.size();
  for (int i = 0; i < n - 2; i++)
    for (int j = 1; j <= 4; j++)
      if (i + j < n && i + 2 * j < n && st[i] == st[i + j] &&
          st[i + j] == st[i + 2 * j]) {
        v.push_back(pair<int, int>(i, i + 2 * j));
        ms.insert(i + 2 * j);
        break;
      }
  int pt = 0;
  for (int i = 0; i < n - 2; i++) {
    while (pt < v.size() && v[pt].first < i) {
      ms.erase(ms.find(v[pt].second));
      pt += 1;
    }
    if (pt == v.size()) {
      if (i + 8 < n) ans += n - i - 8;
      continue;
    }
    int x = *ms.begin(), tmp = 0;
    if (i + 8 < n) tmp = n - i - 8;
    ans += max(n - x, tmp);
  }
  cout << ans;
  return 0;
}