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<int, int>> intervals;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  string s;
  cin >> s;
  for (int i = 0; i < s.size(); ++i) {
    for (int k = 1; k <= 100 and i - 2 * k >= 0; ++k) {
      if (s[i] == s[i - k] and s[i - k] == s[i - 2 * k]) {
        if (intervals.size() and intervals.back().first >= i - 2 * k) continue;
        intervals.emplace_back(i - 2 * k, i);
        break;
      }
    }
  }
  int last = -1;
  long long ans = 0;
  for (int i = 0; i < intervals.size(); ++i) {
    ans += 1LL * (intervals[i].first - last) * (s.size() - intervals[i].second);
    last = intervals[i].first;
  }
  cout << ans;
  return 0;
}