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;
const int maxm = 3e5 + 120;
char que[maxm];
bool check(int l, int r) {
  for (int i = l; i <= r; i++)
    for (int j = i + 1; j <= r && (j << 1) - i <= r; j++)
      if (que[i] == que[j] && que[j] == que[(j << 1) - i]) return true;
  return false;
}
int main() {
  scanf("%s", que);
  int len = strlen(que);
  long long ans = 0;
  for (int i = 0; i < len; i++) {
    int r = i;
    for (; r < len; r++)
      if (check(i, r)) break;
    ans += len - r;
  }
  printf("%lld\n", ans);
  return 0;
}