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>
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 998244353LL;
using namespace std;
bool check(string& s) {
  for (int len = 1; len <= s.size(); len++) {
    for (int i = 0; i < s.size(); i++) {
      if (i + len + len >= s.size()) break;
      if (s[i] == s[i + len] and s[i + len] == s[i + len + len]) return true;
    }
  }
  return false;
}
int main() {
  string s;
  cin >> s;
  int n = s.size();
  long long res = 0;
  for (int left = 0; left < n; left++) {
    int right = left;
    for (; right < min(n, left + 11); right++) {
      string t = s.substr(left, right - left + 1);
      if (check(t)) res++;
    }
    res += n - right;
  }
  cout << res << endl;
  return 0;
}