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;
bool b[12][1 << 11];
char s[300005];
long long ans;
int main() {
  for (int i = 1; i <= 10; i++)
    for (int j = 0; j <= (1 << i) - 1; j++) {
      for (int x = 0; x <= i - 1; x++)
        for (int y = x + 1; y <= i - 1; y++)
          if (y * 2 - x < i && (j >> x & 1) == (j >> y & 1) &&
              (j >> y & 1) == (j >> y * 2 - x & 1))
            b[i][j] = true;
    }
  cin >> s + 1;
  int n = strlen(s + 1);
  for (int i = 1; i <= n; i++) {
    int c = 0;
    for (int j = i; j <= n; j++) {
      if (s[j] == '1') c |= 1 << j - i;
      if (b[j - i + 1][c]) {
        ans += n - j + 1;
        break;
      }
    }
  }
  cout << ans << endl;
  return 0;
}