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 inf = 1e18;
const long long N = 2e5 + 5;
const long long mod = 1000000007;
string s;
long long n;
long long solve(long long ind) {
  long long ans = 0;
  for (long long i = ind; i < min(n, ind + 10); i++) {
    for (long long j = i + 1; j < min(n, ind + 10); j++) {
      long long diff = j - i;
      if (i + 2 * diff < n && s[i] == s[j] && s[i] == s[i + 2 * diff]) {
        ans = max(ans, n - (i + 2 * diff));
      }
    }
  }
  return ans;
}
void testCase() {
  cin >> s;
  n = s.size();
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    ans += solve(i);
  }
  cout << ans << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) testCase();
  return 0;
}