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;
using INT = long long;
int dp[300010][21];
char s[300010];
int ok(int u, int len) {
  if (dp[u][len] != -1) return dp[u][len];
  dp[u][len] = 1;
  for (int i = 0; i < len; i++)
    for (int k = 1; k < len; k++) {
      if (i + 2 * k < len) {
        if (((u >> i) & 1) == ((u >> i + k) & 1) and
            ((u >> i + 2 * k) & 1) == ((u >> i + k) & 1))
          return 1;
      }
    }
  return dp[u][len] = 0;
}
int main() {
  for (int i = 0; i < 300010; i++)
    for (int j = 0; j <= 20; j++) dp[i][j] = -1;
  scanf("%s", s);
  int n = strlen(s);
  INT ans = (INT)n * (n + 1) / 2;
  for (int i = 0; i < n; i++) {
    int res = 0;
    for (int len = 1; i + len <= n; len++) {
      res = res * 2 + s[i + len - 1] - '0';
      if (ok(res, len)) break;
      ans--;
    }
  }
  cout << ans << endl;
  return 0;
}