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 mod = 1e9 + 7;
const int maxn = 3e5 + 10;
char s[maxn];
int to[maxn][3];
int main() {
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  int la0 = 0, la1 = 0;
  for (int i = len; i >= 1; i--) {
    if (s[i] == '0') {
      if (!la0)
        to[i][0] = 0;
      else
        to[i][0] = la0;
      la0 = i;
    } else {
      if (!la1)
        to[i][1] = 0;
      else
        to[i][1] = la1;
      la1 = i;
    }
  }
  if (len < 3) {
    puts("0");
    return 0;
  }
  long long ans = 0, u, v, lu = 0, lv = len + 1;
  for (int i = len - 2; i >= 1; i--) {
    int now, f = 0;
    if (s[i] == '0')
      now = 0;
    else
      now = 1;
    for (int j = to[i][now];; j = to[j][now]) {
      if (j == 0) break;
      int k = j + j - i;
      if (s[k] == s[i] && k <= len) {
        u = i;
        v = k;
        f = 1;
        break;
      }
    }
    if (f && v < lv) {
      ans += 1ll * u * (lv - v);
      lu = u, lv = v;
    }
  }
  printf("%lld\n", ans);
}