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;
bool is(long long int a, long long int b) {
  for (long long int i = 1; i <= (b - a); i++) {
    for (long long int j = a; j < b; j++) {
      if (j + 2 * i > b) break;
      char one = s[j];
      char two = s[j + i];
      char three = s[j + 2 * i];
      if (one == two && two == three) {
        return 1;
      }
    }
  }
  return 0;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> s;
  long long int n = s.length();
  long long int ans = 0;
  for (long long int i = 0; i < n; i++) {
    long long int j = i;
    for (; j < n; j++) {
      if (is(i, j)) {
        break;
      }
    }
    ans += (n - j);
  }
  cout << ans << "\n";
}