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 = 3e5 + 10;
long long ans;
char s[N];
int n, sum, d[N], nxt[N], lst[2];
inline int read() {
  int x = 0, p = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') p = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * p;
}
void init() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
}
void solve() {
  for (int i = 1; i <= n; ++i)
    if (s[i] == '0') {
      nxt[lst[0]] = i;
      lst[0] = i;
    } else {
      nxt[lst[1]] = i;
      lst[1] = i;
    }
  for (int i = 1; i <= n; ++i) {
    int l = i, r = 1e9;
    for (int j = nxt[i]; j && 2 * j - l <= n; j = nxt[j])
      if (s[2 * j - l] == s[i]) {
        r = 2 * j - l;
        break;
      }
    d[l] = r;
  }
  for (int i = n - 1; i >= 1; --i) {
    d[i] = min(d[i], d[i + 1]);
  }
  for (int i = 1; i <= n && d[i] <= n; ++i) {
    ans += n - d[i] + 1;
  }
  cout << ans << '\n';
}
int main() {
  init();
  solve();
  return 0;
}