#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	string S;
	cin >> S;
	
	using tup = tuple<pii, pii, pii>;
	set<tup> ss;
	pii a(1, 1), b(2, 0), c(2, 2);
	ss.insert(tup{a, b, c});
	REP(i, S.size()) {
		auto move = [](pii tar, pii p1, pii p2) -> pii {
			pii res;
			if (p1.first == p2.first) {
				int d = tar.first - p1.first;
				res = {p1.first - d, tar.second};
			}
			else {
				if (tar.first == p2.first) swap(p1, p2);
				res = {tar.first + (p2.first - tar.first), tar.second + (p1.second - tar.second) / 2 * 3};
			}
			return res;
		};
		
		if (S[i] == 'a') a = move(a, b, c);
		else if (S[i] == 'b') b = move(b, a, c);
		else c = move(c, a, b);
		
		ss.insert(tup{a, b, c});
	}
	cout << ss.size() << endl;
}