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;
const long long mod = 1000000007;
const long long inf = 1e15;
const long long N = 3e5 + 10;
int main() {
  string s;
  cin >> s;
  long long ans = 0;
  long long n = s.size();
  std::vector<long long> maxr(n + 1, n);
  for (long long l = n - 1; l >= 0; l--) {
    maxr[l] = maxr[l + 1];
    for (long long k = 1; l + k + k < maxr[l]; k++) {
      if (s[l] == s[l + k] and s[l] == s[l + k + k]) {
        maxr[l] = l + k + k;
        break;
      }
    }
    ans += n - maxr[l];
  }
  cout << ans;
  return 0;
}