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 N = 300300;
int n;
char s[N];
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    int nxt = n + 1;
    int len = min(n + 1 - i, 9);
    for (int x = 0; x < len; ++x) {
      for (int k = 1; k < len; ++k) {
        if (x + 2 * k >= len) continue;
        if (s[i + x] == s[i + x + k] && s[i + x] == s[i + x + 2 * k])
          nxt = min(nxt, i + x + 2 * k);
      }
    }
    ans += n + 1 - nxt;
  }
  printf("%lld\n", ans);
}