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 n;
char s[600000];
bool check(int a, int m) {
  for (int i = 0; i < m; i++) {
    for (int j = 1; i + 2 * j < m; j++) {
      if ((a & (1 << i)) && (a & (1 << (i + j))) && (a & (1 << (i + 2 * j))))
        return true;
      if (!(a & (1 << i)) && !(a & (1 << (i + j))) && !(a & (1 << (i + 2 * j))))
        return true;
    }
  }
  return false;
}
int main() {
  scanf("%s", s);
  n = strlen(s);
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    int t = 0;
    int k = 0;
    for (int j = i; j >= i - 7 && j >= 0; j--) {
      if (s[j] == '1') t += (1 << k);
      k++;
      if (check(t, k)) {
        ans++;
      }
    }
    if (i >= 7) ans += (i - 7);
  }
  printf("%lld", ans);
  return 0;
}