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 int LEN = 8;
set<string> bad[LEN + 1];
int isBad(string s) {
  for (int i = 0; i < s.size(); i++)
    for (int k = 1; i - k >= 0 && i + k < s.size(); k++)
      if (s[i] == s[i - k] && s[i] == s[i + k]) return 0;
  return 1;
}
void preCalc() {
  for (int n = 1; n <= LEN; n++)
    for (int mask = 0; mask < 1 << n; mask++) {
      string s;
      for (int i = 0; i < n; i++) s += char('0' + (mask >> i & 1));
      if (isBad(s)) bad[n].insert(s);
    }
}
int main() {
  ios::sync_with_stdio(0);
  preCalc();
  string s;
  cin >> s;
  int n = s.size();
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 1; j <= LEN && i + j <= n; j++)
      ans += 1 - bad[j].count(s.substr(i, j));
    if (i + LEN < n) ans += n - i - LEN;
  }
  cout << ans << endl;
}