#include <bits/stdc++.h>
const int MAX_N = 3e5;
char s[MAX_N + 10];
int l[MAX_N + 10], r[MAX_N + 10];
int main() {
  scanf("%s", s);
  int n = 0, slen = strlen(s);
  l[0] = -1, r[0] = -1;
  for (int right = 0; right < slen; right++)
    for (int k = 1; right - 2 * k > l[n]; k++)
      if (s[right] == s[right - k] && s[right] == s[right - 2 * k])
        l[++n] = right - 2 * k, r[n] = right;
  long long res = 0;
  for (int i = 1; i <= n; i++) res += (l[i] - l[i - 1]) * (slen - r[i]);
  printf("%lld\n", res);
}
