#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

//using lll=boost::multiprecision::cpp_int;
//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<128>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

ll mypow(ll x, ll n, const ll &p = -1)
{ //x^nをmodで割った余り

	if (p != -1)
	{
		x =(x%p+p)%p;
	}
	ll ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
//using namespace atcoder;

using P=pair<int,int>;

P operator+(P x,P y){
	return P{x.fi+y.fi,x.se+y.se};
}

void solve()
{	
	string s;
	cin>>s;

	int n=s.size();
	int ans=n;
	set<P>st;
	P pos={0,0};
	st.emplace(pos);
	vector<vector<P>>v(6,vector<P>(3));
	P a={-1,0},b={1,0},c={0,-1},d={0,1};
	v[0][0]=a,v[0][1]=c,v[0][2]=b;
	v[1][0]=b,v[1][1]=a,v[1][2]=d;
	v[2][0]=b,v[2][1]=a,v[2][2]=c;
	v[3][0]=a,v[3][1]=d,v[3][2]=b;
	v[4][0]=c,v[4][1]=b,v[4][2]=a;
	v[5][0]=d,v[5][1]=b,v[5][2]=a;
	int cur=0;
	rep(i,n){
		pos=pos+v[cur][s[i]-'a'];
		st.emplace(pos);
		if(cur==0){
			if(s[i]=='a')cur=1;
			else if(s[i]=='b')cur=3;
			else cur=5;
		}else if(cur==1){
			if(s[i]=='a')cur=0;
			else if(s[i]=='b')cur=4;
			else cur=2;
		}else if(cur==2){
			if(s[i]=='a')cur=3;
			else if(s[i]=='b')cur=5;
			else cur=1;
		}else if(cur==3){
			if(s[i]=='a')cur=2;
			else if(s[i]=='b')cur=0;
			else cur=4;
		}else if(cur==4){
			if(s[i]=='a')cur=5;
			else if(s[i]=='b')cur=1;
			else cur=3;
		}else{
			if(s[i]=='a')cur=4;
			else if(s[i]=='b')cur=2;
			else cur=0;
		}
	}
	cout<<st.size()<<"\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}