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>
#pragma GCC optimize(2)
using namespace std;
const int maxn = 3e5 + 10;
char s[maxn];
int a[maxn], n;
int main() {
  cin >> s;
  n = strlen(s);
  for (int i = 0; i < n; i++) a[i] = s[i] - '0';
  long long tot = 0;
  for (int i = 0; i < n; i++) {
    for (int j = i + 2; j < n; j++) {
      int ok = 0;
      for (int k = i; k < j; k++) {
        if ((j + k) % 2 == 0 && a[j] == a[k] && a[k] == a[(j + k) / 2]) {
          ok = 1;
          break;
        }
      }
      if (ok) {
        tot += (n - j);
        break;
      }
    }
  }
  cout << tot << endl;
  return 0;
}