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;
int main() {
  ios::sync_with_stdio(false);
  string s;
  cin >> s;
  int ra[s.length()];
  for (int i = 0; i < s.length(); i++) {
    ra[i] = s.length();
    for (int j = 1; j <= 4; j++) {
      if (i + j * 2 < s.length() && s[i] == s[i + j] && s[i] == s[i + j * 2]) {
        ra[i] = i + j * 2;
        break;
      }
    }
  }
  long long ans = 0;
  for (int i = s.length() - 2; i >= 0; i--) {
    ra[i] = min(ra[i], ra[i + 1]);
    ans += s.length() - ra[i];
  }
  printf("%lld\n", ans);
  return 0;
}