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 warning(disable : 4996)
int __builtin_popcount(int n) {
  int x = 0;
  while (n) n -= n & (-n), x++;
  return x;
}
using namespace std;
const int mod = 1000000009;
const int inf = 2012345678;
const long long infl = 9012345678901234567;
const double pi = 3.1415926535897932384626433832795;
const int N = 301010;
char s[N];
int main() {
  freopen("input.txt", "r", stdin);
  scanf("%s", s);
  int n = strlen(s);
  long long ans = 1LL * n * (n + 1) / 2;
  for (int i = 0; i < (n); i++) {
    for (int jj = 0; jj < (8); jj++) {
      int j = i + jj;
      if (j >= n) break;
      bool good = false;
      for (int k = i; k <= j; k++) {
        for (int t = k + 2; t <= j; t += 2) {
          int mid = (k + t) / 2;
          if (s[k] == s[mid] && s[mid] == s[t]) good = true;
        }
      }
      if (!good) ans--;
    }
  }
  printf("%lld\n", ans);
}