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 cansel_sync = (ios::sync_with_stdio(0), cin.tie(0), 0);
long long gcd(long long a, long long b) {
  while (b ^= a ^= b ^= a %= b)
    ;
  return a;
}
string s;
int n, mid;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>
    q;
void solve() {
  cin >> s;
  n = s.size();
  for (int i = (0); i <= (n - 1); i++) {
    for (int j = i + 2; j < n; j += 2) {
      mid = (i + j) >> 1;
      if (s[mid] == s[i] && s[mid] == s[j]) {
        q.push(make_pair(j, i));
        break;
      }
    }
  }
  long long res = 0;
  for (int i = (0); i <= (n - 1); i++) {
    while (!q.empty() && q.top().second < i) {
      q.pop();
    }
    if (q.empty()) break;
    res += n - q.top().first;
  }
  cout << res << endl;
}
int main() { solve(); }