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 long long N = 300007;
const long long M = 200001;
const long long INF = 0x3f3f3f;
const double inf = 2e9 + 7;
const double Pi = acos(-1);
const long long MOD = 100000007;
const double eps = 1e-7;
long long n, m;
char s[N];
int main() {
  while (~scanf("%s", s + 1)) {
    long long l = strlen(s + 1);
    long long pos = 0;
    long long pre = 0;
    long long ans = 0;
    for (long long j = 1; j <= l; j++) {
      for (long long i = j; i <= l; i++) {
        int f = 0;
        for (long long k = 1; i - 2 * k >= j; k++) {
          if (s[i] == s[i - k] && s[i] == s[i - 2 * k]) {
            long long tmp = (l - i + 1);
            ans += tmp;
            f = 1;
            break;
          }
        }
        if (f) break;
      }
    }
    printf("%I64d\n", ans);
  }
  return 0;
}