#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<double,double>;
using T=tuple<P,P,P>;
void solve()
{	
	string s;
	cin>>s;

	int n=s.size();
	int ans=n;
	set<T>st;
	vector<P>p(3);
	p[0]={0.5,sqrt(3)/2};
	p[1]={0,0};
	p[2]={1,0};
	
	p[0]={round(p[0].fi*1e2)/1e2,round(p[0].se*1e2)/1e2};
	st.emplace(p[1],p[0],p[2]);
	auto rot=[](P a,P b,P &c)->void{
		if(a.se==b.se){
			c={c.fi,round((a.se*2-c.se)*1e2)/1e2};
			return;
		}
		if(a.fi==b.fi){
			c={round((a.fi*2-c.fi)*1e2)/1e2,c.se};
			return;
		}
		double A=(a.se-b.se)/(a.fi-b.fi);
		double mx=(a.fi+b.fi)/2,my=(a.se+b.se)/2;
		double B=A*A+1;
		double X=mx-c.fi,Y=my-c.se;
		double C=(A*X-A*A*c.se-my);
		double D=A*A*c.se*c.se-A*2*X*c.se+my*my-Y*Y;
		double y=0;
		if(my-c.se>=0)y=(-C+sqrt(C*C-B*D))/B;
		else y=(-C-sqrt(C*C-B*D))/B;
		double x=c.fi+A*(c.se-y);
		c={round(x*1e2)/1e2,round(y*1e2)/1e2};
		return;
	};

	rep(i,n){
		if(s[i]=='a'){
			rot(p[1],p[2],p[0]);
		}else if(s[i]=='b'){
			rot(p[0],p[2],p[1]);
		}else{
			rot(p[0],p[1],p[2]);
		}

		P a[]={p[0],p[1],p[2]};
		sort(a,a+3);
		st.emplace(a[0],a[1],a[2]);
	}
	cout<<st.size()<<endl;
}

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