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 BINF = 9e18, LINF = 2e9, mod = 998244353, P = 179,
                Q = 1791791791;
const long long MAXN = 5e5 + 7;
set<long long> ll[12];
void solve() {
  string s;
  cin >> s;
  long long ans = 0;
  long long n = s.size();
  for (long long l = 1; l <= 10; ++l) {
    for (long long m = 0; m < (1 << l); ++m) {
      vector<long long> v;
      for (long long j = 0; j < l; ++j) v.push_back((m >> j) & 1);
      bool ok = 0;
      for (long long i = 0; i < l; ++i)
        for (long long k = 1; k < l; ++k)
          if (i + k + k < l && v[i] == v[i + k] && v[i] == v[i + k + k]) ok = 1;
      if (ok) ll[l].insert(m);
    }
  }
  for (long long l = 1; l <= n; ++l) {
    if (l >= 11) {
      ans += (n - l + 1);
    } else {
      long long msk = 0;
      for (long long j = 0; j < l; ++j) msk = (msk << 1) | (s[j] - '0');
      if (ll[l].find(msk) != ll[l].end()) ++ans;
      for (long long j = l; j < n; ++j) {
        msk = (msk << 1) | (s[j] - '0');
        msk &= ((1 << l) - 1);
        if (ll[l].find(msk) != ll[l].end()) ++ans;
      }
    }
  }
  cout << ans;
  return;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cout.precision(40);
  solve();
  return 0;
}