#include #include using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair plint; typedef pair pld; #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((lint)(x).size()) #define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) #define endk '\n' templatebool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } templatebool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); } lint ceil(lint a, lint b) { return (a + b - 1) / b; } lint digit(lint a) { return (lint)log10(a); } const lint MOD = 1e9 + 7, INF = 1e18; lint dx[8] = { 1, 0, -1, 0, 1, -1, 1, -1 }, dy[8] = { 0, 1, 0, -1, -1, -1, 1, 1 }; void YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; } typedef pair Pa; typedef pair tlint; string s; char to[3]; int main() { set v; v.insert({ 0, 0 }); cin >> s; to[0] = 'a'; to[1] = 'b'; to[2] = 'c'; plint curr = { 0, 0 }; REP(i, SZ(s)) { char _to[3]; REP(j, 3) _to[j] = to[j]; if (s[i] == to[2]) { if ((curr.first + curr.second) % 2 == 0) { curr.second--; } else { curr.second++; } } else if (s[i] == to[0]) { curr.first--; to[0] = _to[2]; to[1] = _to[0]; to[2] = _to[1]; } else { curr.first++; to[0] = _to[1]; to[1] = _to[2]; to[2] = _to[0]; } v.insert(curr); } cout << SZ(v) << endk; }