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 inf = 1e17 + 10;
const int N = 4e6 + 10;
const long long mod = 1e9 + 7;
const int base = 131;
const double pi = acos(-1);
map<string, int> ml;
map<int, int> vi;
long long b[N], vis[N], dep[N], num[N], a[N], n, m, k, x, y;
long long ex, ey, cnt, ans, sum, flag, t;
long long nex[N], can[N];
vector<int> res, v;
map<char, int> mp;
string s;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> s;
  x = s.size() - 1;
  int r = x + 1;
  n = x;
  for (int i = x; i >= 0; i--) {
    for (int j = 1; i + 2 * j < r; j++) {
      if (s[i] == s[i + j] && s[i] == s[i + 2 * j]) {
        r = i + 2 * j;
      }
    }
    ans += n - r + 1;
  }
  cout << ans;
}