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() {
  string second;
  cin >> second;
  long long ans = 0;
  long long n = second.size();
  for (int i = 0; i < n; i++) {
    long long l = INT_MAX;
    for (int j = 0; j <= 10; j++) {
      for (int k = 1; k <= 10; k++) {
        if (i + j >= n || i + j + k >= n || i + j + 2 * k >= n) continue;
        if (second[i + j] == second[i + j + k] &&
            second[i + j] == second[i + j + 2 * k])
          l = min(l, i + j + 2LL * k);
      }
    }
    if (l != INT_MAX) ans += (n - l);
  }
  cout << ans << endl;
}