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 inf = 0x3f3f3f3f;
const int mod = 1e7 + 7;
const int N = 3e5 + 10;
const double eps = 1e-10;
const double pi = acos(-1.0);
char s[N];
int main() {
  scanf("%s", s);
  int len = strlen(s);
  long long ans = 0;
  int r = len;
  for (int i = len - 1; i >= 0; i--) {
    for (int k = 1; i + 2 * k < len; k++) {
      if (s[i] == s[i + k] && s[i + k] == s[i + 2 * k]) {
        int tep = i + 2 * k;
        r = min(r, tep);
        break;
      }
    }
    ans += len - r;
  }
  printf("%lld\n", ans);
  return 0;
}