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 + 5;
bool check[N];
int rig[N];
int main() {
  ios::sync_with_stdio(0);
  string s;
  int n, i, j;
  cin >> s;
  n = s.size();
  s = " " + s;
  long long ans = 0;
  for (i = 1; i <= n; i++) {
    if ((int)(s[i] - '0')) {
      check[i] = true;
    }
  }
  for (i = 1; i <= n; i++) {
    j = i + 1;
    while (j <= n && 2 * j - i <= n) {
      if (s[i] == s[j] && s[2 * j - i] == s[i]) {
        break;
      }
      j++;
    }
    rig[i] = min(2 * j - i, n + 1);
  }
  int min1 = n + 1;
  for (i = n; i >= 1; i--) {
    min1 = min(min1, rig[i]);
    ans += n - min1 + 1;
  }
  cout << ans;
}