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 s;
string xxxxxx;
bool czy(int left, int right) {
  for (int x = left; x <= right; x++) {
    for (int k = 1; k <= 15; k++) {
      if (x + 2 * k > right) break;
      if (s[x] == s[x + k] && s[x] == s[x + 2 * k]) return true;
    }
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> xxxxxx;
  s = '0' + xxxxxx;
  n = s.length() - 1;
  long long int res = 0;
  for (int left = 1; left <= n; left++) {
    int right = left + 2;
    if (right > n) continue;
    bool xd = false;
    while (right <= n) {
      bool ok = czy(left, right);
      if (ok) {
        xd = true;
        break;
      } else
        right++;
    }
    if (xd == false) continue;
    res += n - right + 1;
  }
  cout << res << endl;
  return 0;
}