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;
long long a[1000000], i, x, ans[1000000], k, res;
string s;
int main() {
  cin >> s;
  s = "0" + s;
  for (i = 1; i <= 300003; i++) ans[i] = INT_MAX;
  for (i = 1; i <= s.length() - 1; i++) {
    for (k = 1; i + 2 * k < s.length(); k++)
      if ((s[i] == s[i + k]) && (s[i + k] == s[i + k + k])) {
        ans[i] = i + k + k;
        break;
      }
    x = i;
    while ((ans[x] < ans[x - 1]) && (x > 1)) {
      ans[x - 1] = ans[x];
      x--;
    }
  }
  for (i = 1; i <= 300001; i++)
    if (ans[i] != INT_MAX) res += s.length() - ans[i];
  cout << res;
  return 0;
}