#include //#include #define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i)) #define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i)) #define rep(i, n) For((i), 0, (n)) #define rrep(i, n) rFor((i), (n), 0) #define fi first #define se second using namespace std; typedef long long lint; typedef unsigned long long ulint; typedef pair pii; typedef pair pll; template bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; } template T div_floor(T a, T b) { if (b < 0) a *= -1, b *= -1; return a >= 0 ? a / b : (a + 1) / b - 1; } template T div_ceil(T a, T b) { if (b < 0) a *= -1, b *= -1; return a > 0 ? (a - 1) / b + 1 : a / b; } constexpr lint mod = 1000000007; constexpr lint INF = mod * mod; constexpr int MAX = 100010; struct state { int dir, x, y; char c[3]; }; state rot(state t, int d) { state u; u.dir = t.dir ^ 1; if (t.dir == 0) { if (d == 0) { u.c[0] = t.c[2]; u.c[1] = t.c[1]; u.c[2] = t.c[0]; u.x = t.x - 1; u.y = t.y; } else if (d == 1) { u.c[0] = t.c[1]; u.c[1] = t.c[0]; u.c[2] = t.c[2]; u.x = t.x; u.y = t.y - 1; } else { u.c[0] = t.c[0]; u.c[1] = t.c[2]; u.c[2] = t.c[1]; u.x = t.x + 1; u.y = t.y; } } else { if (d == 0) { u.c[0] = t.c[1]; u.c[1] = t.c[0]; u.c[2] = t.c[2]; u.x = t.x; u.y = t.y + 1; } else if (d == 1) { u.c[0] = t.c[0]; u.c[1] = t.c[2]; u.c[2] = t.c[1]; u.x = t.x - 1; u.y = t.y; } else { u.c[0] = t.c[2]; u.c[1] = t.c[1]; u.c[2] = t.c[0]; u.x = t.x + 1; u.y = t.y; } } return u; } int main() { string s; cin >> s; set S = {{0, 0}}; state t; t.dir = t.x = t.y = 0; rep(i, 3) t.c[i] = 'a' + i; for (auto c : s) { rep(i, 3) if (t.c[i] == c) { t = rot(t, i); break; } S.insert({t.x, t.y}); } printf("%d\n", S.size()); }