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;
char s[300000 + 10];
vector<char> a;
long long ans;
int isOk(int idx) {
  int val = 2000000000, k = a.size();
  for (int i = 0; i < k; i++)
    for (int j = i + 1; j < k; j++)
      for (int l = j + 1; l < k; l++)
        if (j - i == l - j && a[i] == a[j] && a[j] == a[l])
          val = min(val, idx + l);
  return val;
}
int main() {
  cin >> (s + 1);
  int n = strlen(s + 1);
  for (int i = 1; i <= n; i++) {
    a.clear();
    for (int j = i; j <= min(n, i + 7); j++) a.push_back(s[j]);
    int val = isOk(i);
    if (val == 2000000000) {
      if (i + 8 <= n) ans += 1LL * (n - i - 7);
    } else
      ans += 1LL * (n - val + 1);
  }
  cout << ans << '\n';
  return 0;
}