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 = 3e5 + 20;
long long a[N];
int main() {
  string s;
  cin >> s;
  long long cnt = 0;
  long long n = s.size();
  for (int i = 0; i < n; i++) {
    long long indx = -1;
    for (int j = i + 2; j < i + 8 && j < n; j++) {
      if (j % 2 != i % 2) continue;
      if (s[i] == s[j] && s[i] == s[(i + j) / 2]) {
        indx = j;
        break;
      }
    }
    a[i] = indx;
  }
  for (int i = 0; i < n; i++) {
    long long indx = -1;
    for (int j = i; j < i + 8 && j < n; j++) {
      if (a[j] != -1 && a[j] < i + 8) {
        if (indx == -1)
          indx = a[j];
        else
          indx = min(indx, a[j]);
      }
    }
    if (indx != -1) cnt += max(min(7ll, n - 1 - i) + i - indx + 1, 0ll);
    cnt += max(0ll, n - 1 - i - 8 + 1);
  }
  cout << cnt;
}