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>
#pragma warning(disable : 6031)
#pragma warning(disable : 4101)
using namespace std;
const int INF = 1e9;
const long long LINF = 1e18;
const double PI = acos(-1);
const int MAXN = 300005;
int n, L[MAXN];
char str[MAXN];
long long ans = 0;
int main() {
  scanf(" %s", str);
  n = strlen(str);
  L[n - 1] = n - 1;
  L[n - 2] = n - 1;
  for (int i = n - 3; i >= 0; i--) {
    L[i] = L[i + 1];
    for (int k = 1; i + 2 * k <= L[i]; k++) {
      if (str[i] == str[i + k] && str[i] == str[i + 2 * k]) {
        L[i] = i + 2 * k - 1;
      }
    }
    ans += n - L[i] - 1;
  }
  printf("%lld\n", ans);
  return 0;
}