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;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
const int N = 3e5 + 20;
int n, res[N];
string s;
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> s;
  n = (int)s.size();
  fill(res, res + N, n);
  for (int i = 0; i < n; i++) {
    for (int k = 1; k <= min(i, n - 1 - i) && k <= 20; k++) {
      if (s[i - k] == s[i] && s[i] == s[i + k]) {
        res[i - k] = min(res[i - k], i + k);
      }
    }
  }
  for (int i = n - 2; i >= 0; i--) res[i] = min(res[i], res[i + 1]);
  ll ans = 0;
  for (int i = 0; i < n; i++) ans += (n - res[i]);
  cout << ans << '\n';
}