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 maxnodes = 1005;
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n;
  string s;
  cin >> s;
  n = s.length();
  vector<int> ml(n, -1);
  set<int> st;
  for (int i = 0; i < n; i++) {
    st.insert(i);
  }
  for (int k = 1; k < n; k++) {
    vector<int> er;
    for (auto it : st) {
      if (it + 2 * k > n) break;
      if (s[it] == s[it + k] and s[it] == s[it + 2 * k]) {
        ml[it + 2 * k] = max(ml[it + 2 * k], it);
        er.push_back(it);
      }
    }
    for (auto it : er) st.erase(it);
  }
  long long ans = 0;
  int r = -1;
  for (int i = 0; i < n; i++) {
    r = max(r, ml[i]);
    ans += (r + 1);
  }
  cout << ans;
  return 0;
}