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 maxm = 2e3 + 23;
const int maxn = 3e5 + 35;
char s[maxn];
int dp[maxn];
int main() {
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  long long ans = 0;
  for (int i = 3; i <= len; ++i) {
    dp[i] = dp[i - 1];
    for (int j = i - 1; j - (i - j) > 0 && j - (i - j) > dp[i]; --j) {
      if (s[i] == s[j] && s[j] == s[j - (i - j)]) {
        dp[i] = j - (i - j);
        break;
      }
    }
    ans += dp[i];
  }
  cout << ans << '\n';
  return 0;
}