#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  string s;
  cin >> s;
  int n = SZ(s);
  vector<vector<int>> cnt(n + 1, vector<int>(26));
  for (int i = 0; i < n; ++i) {
    cnt[i + 1] = cnt[i];
    int k = s[i] - 'a';
    cnt[i + 1][k]++;
  }
  int64 ret = 0;
  int pre = -1, pos = n;
  for (int i = n - 2; i >= 0; --i) {
    if (s[i] == s[i + 1] && s[i] != s[i + 2]) {
      int j = i + 2;
      int k = s[i] - 'a';
      ret += (pos - j) - (cnt[pos][k] - cnt[j][k]);
      if (k != pre) {
        ret += n - pos;
      }
      pre = k;
      pos = i;
    }
  }
  cout << ret << '\n';

  return 0;
}

#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 10;

long long n;
unordered_set<long long> st;

int main()
{
    long long ans = 0;
    cin >> n;
    for (int i = 2; ; ++i)
    {
        if ((long long)round(pow(i, 2)) > n)
            break;
        for (int j = 2; ; ++j)
        {
            if ((long long)round(pow(i, j)) > n)
                break;
            st.insert((long long)round(pow(i, j)));
        }
    }
        
    cout << n - st.size() << endl;
    return 0;
}