#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll modpow(ll x, ll p) { ll result = 1, now = 1, pm = x; while (now<=p) { if (p&now) { result = result * pm % MOD; } now*=2; pm = pm*pm % MOD; } return result; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

struct coord { 
  ll x, y, p; 
  bool operator< (const coord &c) const { return x<c.x||(x==c.x&&(y<c.y||(y==c.y&&p<c.p))); };
};

int main() {
  string S; cin >> S;
  coord nc = {0,0,0};
  set<coord> sc; sc.insert(nc);
  rep(i,S.size()) {
    if (S[i]=='a') {
      if (nc.p==0)      nc = { nc.x-1, nc.y+1, 3 };
      else if (nc.p==1) nc = { nc.x-1, nc.y-1, 4 };
      else if (nc.p==2) nc = { nc.x  , nc.y-2, 5 };
      else if (nc.p==3) nc = { nc.x+1, nc.y-1, 0 };
      else if (nc.p==4) nc = { nc.x+1, nc.y+1, 1 };
      else if (nc.p==5) nc = { nc.x  , nc.y+2, 2 };
    }
    if (S[i]=='b') nc = { nc.x, nc.y, nc.p%2==0 ? (nc.p+1)%6 : (nc.p+5)%6 };
    if (S[i]=='c') nc = { nc.x, nc.y, nc.p%2==0 ? (nc.p+5)%6 : (nc.p+1)%6 };
    sc.insert(nc);
  }
  ll result = sc.size();
  cout << result << endl;
  return 0;
}