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;
long long ans = 0;
int solve(int f, int l) {
  for (int i = f; i <= l - 2; ++i) {
    for (int j = i + 1; j <= l - 1; ++j) {
      for (int k = j + 1; k <= l; ++k) {
        if (j - i == k - j && (s[i] == s[j]) && (s[j] == s[k])) {
          return 1;
        }
      }
    }
  }
  return 0;
}
int main(void) {
  ios ::sync_with_stdio(0);
  cin.tie(0);
  cin >> s;
  n = s.length();
  s = '*' + s;
  for (int i = 1; i <= n; ++i) {
    for (int j = i + 2; j <= min(n, i + 7); ++j) {
      ans += solve(i, j);
    }
    ans += max(n - i - 7, 0);
  }
  cout << ans << "\n";
  return 0;
}