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 int NMAX = 3e5;
long long ans = 0;
bool v[NMAX + 6];
int main() {
  string s;
  cin >> s;
  int N = s.size();
  for (int i = 0; i < N; ++i) v[i] = (s[i] - '0');
  for (int i = 0; i < N; ++i) {
    int last = -1;
    for (int j = i + 2; j < N && last == -1; ++j) {
      for (int mij = j - 1; mij - (j - mij) >= i; --mij) {
        if (v[mij - (j - mij)] == v[mij] && v[mij] == v[j]) {
          last = j;
          break;
        }
      }
    }
    if (last != -1) {
      ans += (N - last);
    }
  }
  cout << ans << '\n';
  return 0;
}