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;
const int N = 300005;
int n, a[N];
ll r;
char s[N];
int chk(int x, int y) {
  for (int i = x; i <= y; i++) {
    for (int j = 1; i + 2 * j <= y; j++) {
      if (a[i] == a[i + j] && a[i + j] == a[i + 2 * j]) return 1;
    }
  }
  return 0;
}
int main() {
  scanf("%s", s);
  n = strlen(s);
  for (int i = 0; i < n; i++) a[i] = (s[i] == '1');
  for (int i = 0; i < n; i++) {
    for (int j = 3; i + j - 1 < n; j++) {
      if (chk(i, i + j - 1)) {
        r += (n - (i + j - 1));
        break;
      }
    }
  }
  printf("%lld\n", r);
}