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>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef int ll;
const ll MAX = 3e5 + 20;
const ll mod = 1e9 + 7;
const ll inf = 1e9;
string s;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> s;
  ll n = s.size();
  long long ans = (1LL * n * (n - 1)) / 2;
  string aux = "";
  for (ll i = 0; i < (ll)n; i++) {
    aux.push_back(s[i]);
    for (ll j = i + 1; j < (ll)min(n, i + 12); j++) {
      aux.push_back(s[j]);
      if (aux.size() > 2) {
        ll pos = aux.size() - 1;
        bool go = false;
        for (ll k = pos - 2; k >= (ll)0; k -= 2) {
          if (aux[k] == aux[pos] && aux[k] == aux[(k + pos) / 2]) {
            go = true;
            break;
          }
        }
        if (go) break;
      }
      ans--;
    }
    aux.clear();
  }
  cout << ans << endl;
  return 0;
}