#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------


string S;
int X,Y;
set<pair<int,int>> G;
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	
	cin>>S;
	X=Y=500001;
	G.insert({X,Y});
	FORR(c,S) {
		c-='a';
		if((X+Y)%2==0) {
			if((X+Y)/2%3==c%3) Y--;
			else if((X+Y)/2%3==(c+2)%3) X--;
			else if((X+Y)/2%3==(c+1)%3) X++;
		}
		else {
			if((X)%3==c) Y++;
			else if((X)%3==(c+2)%3) X++;
			else if((X)%3==(c+1)%3) X--;
		}
		G.insert({X,Y});
		//cout<<(X-500001)<<" "<<(Y-500001)<<endl;
	}
	cout<<G.size()<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}