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 maxn = 131072;
const int INF = 1e9 + 100;
struct data {
  long long max;
  long long p_d;
};
void solve() {
  string s;
  cin >> s;
  long long ans = 0;
  for (int i = 0; i < s.size(); i++) {
    int last_pos = -1;
    for (int j = i + 1; j < s.size(); j++) {
      for (int k = i; k < j; k++) {
        if ((j - k) % 2) continue;
        int mid = (j + k) / 2;
        if (s[k] == s[mid] && s[mid] == s[j]) {
          last_pos = j;
          goto fo;
        }
      }
    }
  fo:;
    if (last_pos == -1) {
      continue;
    }
    long long cnt = s.size() - last_pos;
    ans += cnt;
  }
  cout << ans;
}
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  solve();
  return 0;
}