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;
string str;
long long solve() {
  long long ans = 0;
  long long prev_ans = 0;
  for (long long i = 0; i < str.length(); i++) {
    long long k = 1;
    long long ans1 = -1;
    while ((i - 2 * k) >= 0 &&
           !(str[i] == str[i - k] && str[i] == str[i - 2 * k])) {
      k++;
    }
    if ((i - (2 * k)) >= 0)
      ans1 = k;
    else {
      ans = ans + prev_ans;
      continue;
    }
    ans1 = k;
    long long ans2 = max(prev_ans, max((long long)0, i - (2 * k) + 1));
    prev_ans = max(prev_ans, ans2);
    ans = ans + ans2;
  }
  return ans;
}
signed main() {
  cin >> str;
  cout << solve() << "\n";
  return 0;
}