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 N = 100 + 20;
const int oo = 1e9 + 20;
const int MOD = 1e9 + 7;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  string s;
  while (cin >> s) {
    long long ans = 0;
    for (int l = 0; l < (int)s.size(); l++) {
      for (int r = l + 1; r < (int)s.size(); r++) {
        bool f = 0;
        for (int k = 1; k <= 20 && !f; k++) {
          for (int from = l; from + 2 * k <= r && !f; from++) {
            f |= s[from] == s[from + k] && s[from + k] == s[from + 2 * k];
          }
        }
        if (f) {
          ans += ((int)s.size() - r);
          break;
        }
      }
    }
    cout << ans << '\n';
  }
  return 0;
}