#include <bits/stdc++.h>
using namespace std;
char s[300010];
int a[300010];
int main() {
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  int cnt = 0;
  long long res = 0;
  for (int i = 3; i <= len; i++) {
    for (int j = i - 2; j >= cnt; j -= 2) {
      if (s[i] == s[j] && s[i] == s[(i + j) / 2]) {
        cnt = max(cnt, j);
        break;
      }
    }
    res += cnt;
  }
  printf("%lld\n", res);
}

### 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;
char s[300010];
int a[300010];
int main() {
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  int cnt = 0;
  long long res = 0;
  for (int i = 3; i <= len; i++) {
    for (int j = i - 2; j >= cnt; j -= 2) {
      if (s[i] == s[j] && s[i] == s[(i + j) / 2]) {
        cnt = max(cnt, j);
        break;
      }
    }
    res += cnt;
  }
  printf("%lld\n", res);
}

```