#include "bits/stdc++.h"

#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
#define fi first
#define se second

using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};
using vec = tuple<ll, ll, ll>;

vec inv(vec a){
  return {-get<0>(a), -get<1>(a), -get<2>(a)};
}

vec add(vec a, vec b){
  return {get<0>(a) + get<0>(b), get<1>(a) + get<1>(b), get<2>(a) + get<2>(b)};
}

/**************************************
** A main function starts from here  **
***************************************/
int main(){
  string S;
  cin >> S;
  vec a={1, 0, 0};
  vec b={0, 1, 0};
  vec c={0, 0, 1};
  vec loc = {0, 0, 0};
  set<vec> s;
  s.insert(loc);
  rep(i, S.size()){
    if(S[i]=='a'){
      loc = add(loc, a);
      swap(b, c);
    }else if(S[i]=='b'){
      swap(a, c);
      loc = add(loc, b);      
    }else{
      swap(a, b);
      loc = add(loc, c);
    }
    b = inv(b);
    c = inv(c);
    a = inv(a);
    s.insert(loc);
  }
  cout << s.size();
  return 0;
}