#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
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 (b < a) { a = b; return 1; } return 0; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
#define eps 1e-12 
//priority_queue<int,vector<int>, greater<int> > q2;


signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	string S; cin >> S;
	int N = S.size();
	VI A(N);
	REP(i, N) {
		if (S[i] == 'a')A[i] = 0;
		if (S[i] == 'b')A[i] = 1;
		if (S[i] == 'c')A[i] = 2;
	}
	int ans = 0;
	map<pii, bool>mp;
	int x = 0, y = 0;
	//int type[3] = { 0,1,2 };//その記号がどの移動に対応するか
	VI type = { 0,1,2 };

	mp[(pii) { x, y }] = 1;
	REP(i, N) {
		int t = type[A[i]];
		VI tmp(3);
		if (t == 0) {
			x--;
			REP(j, 3) {
				type[j]++;
				type[j] %= 3;
			}
		}
		else if (t == 1) {
			x++;
			REP(j, 3) {
				type[j]--;
				type[j] += 3;
				type[j] %= 3;
			}
		}
		else {
			if (y % 2) {
				y--;
			}
			else {
				y++;
			}
		}
		if (!mp[(pii) { x, y }]) {
			ans++;
			mp[(pii) { x, y }] = 1;
		}
		//cout << x << " " << y << endl;
	}




	cout << ++ans << endl;
	return 0;
}