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 dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
string s;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int ans = 0;
  cin >> s;
  int last = 0;
  int n = int(s.size());
  int atual = n;
  int vec[3 * (int)(1e5 + 10)];
  memset(vec, 0, sizeof vec);
  vec[n] = n;
  for (int i = int(s.size()) - 1; i >= 0; i--) {
    vec[i] = vec[i + 1];
    for (int tam = 1; i + 2 * tam < vec[i]; tam++) {
      if (i + (2 * tam) >= int(s.size())) break;
      if (s[i] == s[i + tam] and s[i] == s[i + (2 * tam)]) {
        vec[i] = i + (2 * tam);
        break;
      }
    }
    ans += n - vec[i];
  }
  cout << ans << "\n";
  return 0;
}