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 pii = std::pair<int, int>;
using pll = std::pair<long long, long long>;
const int maxn = 3e5 + 100;
bool ok[maxn];
int minr[maxn];
int main() {
  std::ios::sync_with_stdio(false);
  std::string s;
  std::cin >> s;
  int n = s.length();
  for (int i = 0; i < n; i++) ok[i] = s[i] - '0';
  for (int i = 0; i < n; i++) {
    int o = -1;
    for (int k = 1; i + 2 * k < n; k++) {
      if (ok[i] == ok[i + k] && ok[i + k] == ok[i + 2 * k]) {
        o = k;
        break;
      }
    }
    if (o > 0)
      minr[i] = i + 2 * o;
    else
      minr[i] = 0x3f3f3f3f;
  }
  int m = 0x3f3f3f3f;
  long long ans = 0;
  for (int i = n - 1; i >= 0; i--) {
    m = std::min(m, minr[i]);
    if (m <= n) {
      ans += 1ll * (n - m);
    }
  }
  std::cout << ans << std::endl;
  return 0;
}