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 n;
string line;
vector<int> nol, satu;
int angka[300005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> line;
  n = line.size();
  long long ans = 0;
  int zero = -1, one = -1;
  for (int i = 0; i < n; i++) {
    if (line[i] == '0') {
      if (nol.size() >= 2) {
        for (int j = nol.size() - 1; j >= 0 && i - 2 * (i - nol[j]) > zero;
             j--) {
          if (angka[i - 2 * (i - nol[j])] == 0) {
            zero = i - 2 * (i - nol[j]);
            break;
          }
        }
      }
      nol.push_back(i);
    } else {
      if (satu.size() >= 2) {
        for (int j = satu.size() - 1; j >= 0 && i - 2 * (i - satu[j]) > one;
             j--) {
          if (angka[i - 2 * (i - satu[j])] == 1) {
            one = i - 2 * (i - satu[j]);
            break;
          }
        }
      }
      satu.push_back(i);
    }
    ans += max(zero, one) + 1;
    angka[i] = line[i] - '0';
  }
  cout << ans << '\n';
  return 0;
}