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;
string s;
int n;
int check(int l, int r) {
  for (int k = 1; l + 2 * k < r; k++) {
    for (int x = l; x + 2 * k < r; x++) {
      if (s[x] == s[x + k] && s[x + k] == s[x + 2 * k]) return 1;
    }
  }
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> s;
  n = (int)(s.size());
  long long prs = 0;
  for (int w = 3; w <= 8; w++) {
    for (int i = 0; i + w <= n; i++) {
      prs += check(i, i + w);
    }
  }
  for (int l = 9; l <= n; l++) {
    prs += n - l + 1;
  }
  cout << prs;
  return 0;
}