#include <bits/stdc++.h>
using namespace std;
string s;
bool judge(int l, int r) {
  for (int i = l; i <= r - 2; i++)
    for (int k = 1; k <= 3 && i + 2 * k <= r; k++)
      if (s[i] == s[i + k] && s[i] == s[i + 2 * k]) return 1;
  return 0;
}
int main() {
  cin >> s;
  int n = s.size();
  long long res = 0;
  if (n >= 9) res = (long long)(n - 7) * (n - 8) / 2;
  for (int i = 0; i < n; i++)
    for (int j = 2; j < 8 && i + j < n; j++)
      if (judge(i, i + j)) res = (res + 1);
  printf("%lld\n", res);
}

### Prompt

Create a solution in Cpp for 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;
string s;
bool judge(int l, int r) {
  for (int i = l; i <= r - 2; i++)
    for (int k = 1; k <= 3 && i + 2 * k <= r; k++)
      if (s[i] == s[i + k] && s[i] == s[i + 2 * k]) return 1;
  return 0;
}
int main() {
  cin >> s;
  int n = s.size();
  long long res = 0;
  if (n >= 9) res = (long long)(n - 7) * (n - 8) / 2;
  for (int i = 0; i < n; i++)
    for (int j = 2; j < 8 && i + j < n; j++)
      if (judge(i, i + j)) res = (res + 1);
  printf("%lld\n", res);
}

```