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;
long long ar[500000];
int main() {
  string s;
  cin >> s;
  long long ans = 0, last = 0, ma = -1, start = -1;
  for (long long i = 0; i < s.size(); ++i) {
    long long min_t = s.size();
    for (long long j = i + 1; j < min(s.size(), (size_t)i + 10); ++j) {
      long long t = j + (j - i);
      if (t < s.size() && s[i] == s[j] && s[j] == s[t]) {
        min_t = t;
        break;
      }
    }
    ar[i] = min_t;
  }
  long long cur = s.size();
  for (long long i = s.size() - 1; i >= 0; --i) {
    cur = min(cur, ar[i]);
    ans += s.size() - cur;
  }
  cout << ans << "\n";
}