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>
const int oo = 0x7fffffff;
const long long OO = 0x7fffffffffffffff;
using namespace std;
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(0);
  std::cout.tie(0);
  ;
  string s;
  cin >> s;
  int n = s.size();
  vector<int> next_0(n, oo), next_1(n, oo), next(n, oo);
  int least = oo;
  for (int l = n - 1; l >= 0; --l) {
    for (int r = l + 2; r < n and r < least; r += 2) {
      if (s[r] == s[l] and s[l] == s[l + (r - l) / 2]) {
        least = r;
        break;
      }
    }
    next[l] = least;
  }
  long long ans = 0;
  for (int l = 0; l < n; ++l) {
    if (next[l] == oo) break;
    ans += (n - next[l]);
    ;
  };
  cout << ans << "\n";
  return 0;
}