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 MAXN = 1e6 + 10;
const long long INF = 1e9 + 10;
const int MOD = 998244353;
int n, a[MAXN];
string second;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> second;
  n = (int)second.size();
  for (int i = 0; i < n; i++) {
    a[i] = n;
    for (int j = 1; i + 2 * j < min(n, i + 10); j++) {
      if (second[i] == second[i + j] && second[i] == second[i + 2 * j]) {
        a[i] = i + 2 * j;
        break;
      }
    }
  }
  long long ans = (long long)(n + 1) * n / 2;
  int minn = n;
  for (int i = n - 1; i >= 0; i--) {
    minn = min(minn, a[i]);
    ans -= (minn - i);
  }
  cout << ans;
  return 0;
}