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 ck(string s) {
  long long n = s.length();
  for (long long i = 0; i < n; i++) {
    for (long long j = 1; (i + 2 * j) < n; j++) {
      if (s[i] == s[i + j] && s[i + j] == s[i + (2 * j)]) return true;
    }
  }
  return false;
}
signed main() {
  string s;
  cin >> s;
  long long n = s.length();
  long long ans = ((n - 8) * (n - 7)) / 2;
  if (n < 9) ans = 0;
  for (long long i = 0; i < s.length(); i++) {
    for (long long j = 1; j <= 8 && (i + j) <= s.length(); j++) {
      if (ck(s.substr(i, j))) {
      }
      ans += ck(s.substr(i, j));
    }
  }
  cout << ans;
}