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 is_good(string &S) {
  for (int x = 0; x < S.size(); x++) {
    for (int k = 1; x + 2 * k < S.size(); k++) {
      if (S[x] == S[x + k] && S[x + k] == S[x + 2 * k]) {
        return true;
      }
    }
  }
  return false;
}
int main() {
  string S;
  cin >> S;
  long long answer = 0;
  for (int left = 0; left < S.size(); left++) {
    for (int length = 2; length <= 9 && left + length - 1 < S.size();
         length++) {
      string substring = S.substr(left, length);
      if (is_good(substring)) {
        int right = left + length - 1;
        answer += (S.size() - 1) - (right - 1);
        break;
      }
    }
  }
  cout << answer;
  return 0;
}