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;
using ll = long long;
using vi = vector<int>;
const int MAX = 3e5 + 10;
char S[MAX];
const int BO = 20;
int P[MAX];
int T[MAX];
int main() {
  scanf("%s", S);
  ll res = 0;
  int n = strlen(S);
  for (int len = 3; len <= n; len++) {
    if (len >= BO) {
      res += (n - len + 1);
    } else {
      for (int i = 0; i + len - 1 < n; i++) {
        T[i] = max(P[i], P[i + 1]);
        if (T[i] == 1)
          res++;
        else {
          if (len % 2 == 0) continue;
          if (S[i] == S[i + len / 2] && S[i + len / 2] == S[i + len - 1]) {
            T[i] = 1;
            res++;
          }
        }
      }
      for (int i = 0; i < n; i++) {
        P[i] = T[i];
        T[i] = 0;
      }
    }
  }
  printf("%lld\n", res);
}