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;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s;
  cin >> s;
  long long ans = 0;
  for (int l = 0; l + 2 < s.size(); l++) {
    for (int r = l + 1; r <= l + 7 && r < s.size(); r++) {
      bool good = false;
      for (int k = 1; l + 2 * k <= r; k++) {
        for (int i = l; i + 2 * k <= r; i++) {
          if (s[i] == s[i + k] && s[i] == s[i + 2 * k]) {
            good = true;
            break;
          }
        }
        if (good) {
          break;
        }
      }
      if (good) {
        ans++;
      }
    }
  }
  for (int i = 1; i <= s.size(); i++) {
    ans += max(0, (int)(s.size()) - i - 7);
  }
  cout << ans;
  return 0;
}