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;
string s;
int r = 1;
int flag = -1;
long long ans = 0;
int main() {
  cin >> s;
  int len = s.size();
  for (int l = 0; l < len && r < len; ++l) {
    while (1) {
      if (flag >= l) break;
      ++r;
      if (r == len) {
        cout << ans;
        return 0;
      }
      for (int k = 1;; ++k) {
        if (r < l + 2 * k) break;
        if (s[r] == s[r - k] && s[r] == s[r - 2 * k]) {
          flag = r - 2 * k;
          break;
        }
      }
    }
    int cha = len - r;
    ans += cha;
  }
  cout << ans;
  return 0;
}