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() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL), cout.tie(NULL);
  ;
  string a;
  cin >> a;
  long long n = a.length();
  long long i, j, k;
  long long ans = 0, f;
  long long pass[n + 2];
  for (i = 0; i <= n; i++) pass[i] = 0;
  for (i = 0; i < n; i++) {
    f = 0;
    for (j = i + 1; j < n; j++) {
      k = j - i;
      if (j + k < n && a[j] == a[i] && a[j + k] == a[i]) {
        f = 1;
        break;
      }
    }
    if (f) {
      pass[i] = n - j - k;
    }
  }
  for (i = n - 2; i >= 0; i--) {
    pass[i] = fmax(pass[i], pass[i + 1]);
    ans += pass[i];
  }
  cout << ans;
  return 0;
}