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 maxn = 300100;
int len;
char sz[maxn];
long long dp[maxn];
int main() {
  scanf("%s", sz + 1);
  len = strlen(sz + 1);
  dp[0] = 0;
  for (int i = 1; i <= len; i++) {
    long long tmp = 0;
    long long r = i, l = max((long long)1, (long long)i - 8);
    for (int j = r; j >= l; j--) {
      if (sz[j] == sz[r]) {
        if ((j + r) % 2 != 0) continue;
        int mid = (j + r) / 2;
        if (mid == j || mid == r) continue;
        if (sz[mid] != sz[r]) continue;
        tmp = max(tmp, (long long)j);
      }
    }
    dp[i] = max(dp[i - 1], tmp);
  }
  long long ans = 0;
  for (int i = 1; i <= len; i++) ans += dp[i];
  printf("%lld\n", ans);
  return 0;
}