#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
	set<pair<int, int>> st;
	char l = 'a', r = 'c', t = 'b';
	string s;
	cin >> s;
	st.insert(make_pair(0, 0));
	int nl = 0, nr = 0;
	for (int i = 0; i < s.size(); i++) {
		if (l == s[i]) {
			nl--;
			char m = r;
			r = l;
			l = t;
			t = m;
		}
		else if (r == s[i]) {
			nl++;
			char m = l;
			l = r;
			r = t;
			t = m;
		}
		else {
			if (i % 2 == 0) {
				nr--;
			}
			else {
				nr++;
			}
		}
		st.insert(make_pair(nl, nr));
	}
	cout << st.size() << endl;
}