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>
const int LIM = 15;
const int MAXN = 300010;
char buf[MAXN];
int n;
bool judge(int* buf, int len) {
  for (int i = 0; i != len; ++i)
    for (int k = 1; i + k * 2 < len; ++k)
      if (buf[i] == buf[i + k] && buf[i] == buf[i + k * 2]) return true;
  return false;
}
bool f[LIM + 1][1 << LIM];
int li[LIM + 1];
void dfs(int u, int S) {
  f[u][S] = judge(li, u);
  if (u < LIM) {
    li[u] = 0;
    dfs(u + 1, S << 1);
    li[u] = 1;
    dfs(u + 1, S << 1 | 1);
  }
}
int main() {
  dfs(0, 0);
  scanf("%s", buf);
  n = strlen(buf);
  long long ans = n * (n + 1ll) >> 1;
  for (int i = 0; i < n; ++i) {
    const int UP = std::min(n, i + LIM);
    int now = 0;
    for (int r = i; r < UP; ++r) {
      now = now << 1 | (buf[r] & 1);
      ans -= !f[r - i + 1][now];
    }
  }
  printf("%lld\n", ans);
  return 0;
}