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;
using ll = long long;
const int N = 1e5 + 5;
bool check(string f) {
  int n = f.size();
  for (int i = 0; i < 9; ++i) {
    for (int j = 1; j <= 9; ++j) {
      if (i < n && i + j < n && i + 2 * j < n) {
        if (f[i] == f[i + j] && f[i] == f[i + 2 * j]) return true;
      }
    }
  }
  return false;
}
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  cin >> s;
  int n = s.size();
  ll ans = 0;
  for (int i = 0; i < n; ++i) {
    string f = "";
    for (int j = i; j < n; ++j) {
      f += s[j];
      if (check(f)) {
        ans += (n - j);
        break;
      }
    }
  }
  cout << ans;
  return 0;
}