#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
char s[maxn];
int main() {
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  int r = len + 1;
  long long res = 0;
  for (int l = len - 2; l >= 1; l--) {
    r = min(l + 8, r);
    int k;
    for (k = 1; l + 2 * k <= r; k++) {
      if (s[l] == s[l + k] && s[l + k] == s[l + 2 * k]) {
        r = min(r, l + 2 * k);
        break;
      }
    }
    res += 1ll * len - r + 1;
  }
  cout << res << endl;
}

### Prompt

In Cpp, your task is to solve the following 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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
char s[maxn];
int main() {
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  int r = len + 1;
  long long res = 0;
  for (int l = len - 2; l >= 1; l--) {
    r = min(l + 8, r);
    int k;
    for (k = 1; l + 2 * k <= r; k++) {
      if (s[l] == s[l + k] && s[l + k] == s[l + 2 * k]) {
        r = min(r, l + 2 * k);
        break;
      }
    }
    res += 1ll * len - r + 1;
  }
  cout << res << endl;
}

```