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 long long inf = 1e9;
const long long base = 998244353;
const long long mod = 1e9 + 7;
int n, m;
bool check(const string& a, int start, int end) {
  for (int i = start; i <= end; ++i) {
    for (int j = 1; j <= end - start + 1; ++j) {
      if (i + 2 * j > end) break;
      if (a[i] == a[i + j] && a[i] == a[i + 2 * j]) return true;
    }
  }
  return false;
}
int main() {
  srand(time(NULL));
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  auto start = clock();
  string a;
  cin >> a;
  long long ans = 0;
  for (int i = 9; i <= a.length(); ++i) {
    ans += 1LL * (a.length() - i + 1);
  }
  for (int i = 0; i < a.length(); ++i) {
    for (int j = i; j < a.length() && j < i + 8; ++j) {
      if (check(a, i, j)) ++ans;
    }
  }
  cout << ans;
  std::cerr << double(clock() - start) / CLOCKS_PER_SEC << std::endl;
  return 0;
}