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 long long maxn = 3e5 + 9;
int main() {
  long long i, n;
  string s;
  cin >> s;
  long long len = s.size();
  long long j = 0;
  long long ans = 0;
  ;
  for (i = 0; i < len; i++) {
    long long flag = 0, k = 1;
    while (j < len) {
      if (j - 2 * k < i) {
        j++;
        k = 1;
        continue;
      }
      if (s[j] == s[j - k] && s[j] == s[j - 2 * k]) {
        flag = 1;
        break;
      }
      k++;
    }
    if (flag)
      ans += len - j;
    else
      break;
  }
  cout << ans << endl;
}