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;
long long M = 1000000007;
const int Max = 300005;
int root = 1 * sqrt(Max);
int arr[Max];
int rig[300005];
int main() {
  string s;
  int n;
  cin >> s;
  n = s.size();
  for (int i = 0; i < n; i++) {
    arr[i] = s[i] - '0';
  }
  for (int i = 0; i < n; i++) {
    for (int k = 1; k <= root; k++) {
      if (i + 2 * k >= n) break;
      int x = arr[i];
      int xk = arr[i + k];
      int xk2 = arr[i + 2 * k];
      if (x == xk && xk == xk2) {
        rig[i] = i + 2 * k;
        break;
      }
    }
  }
  int minr = n;
  long long ans = 0;
  for (int l = n - 1; l >= 0; l--) {
    if (rig[l] != 0) {
      minr = min(minr, rig[l]);
    }
    if (minr != n) ans += 1LL * (n - 1 - (minr) + 1);
  }
  cout << ans << '\n';
  return 0;
}