#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep2(i,m,n) for (int i = (m); i < (n); ++i)
#define rep(i,n) rep2(i,0,n)
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> P;
template<typename T> struct V : vector<T> { using vector<T>::vector; };
V() -> V<int>;
V(size_t) -> V<int>;
template<typename T> V(size_t, T) -> V<T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
const int INF = 1<<30;
const ll LINF = 1LL<<61;
// const ll MOD = 1000000007;
// const ll MOD = 998244353;
using mint = modint1000000007;

P add(P a, P b) { return P(a.first + b.first, a.second + b.second); }
P neg(P a) { return P(-a.first, -a.second); }

int main()
{
    string s;
    cin >> s;
    set<P> coords;
    map<char, P> d;
    d['a'] = P(-1, 0);
    d['b'] = P(1, 0);
    d['c'] = P(1, -1);
    P cur = P(0,0);
    coords.insert(cur);
    bool up = true; // 上向きか
    for(auto c:s)
    {
        cur = add(cur, d[c]);
        coords.insert(cur);
        for(auto itr = d.begin(); itr != d.end(); itr++)
        {
            itr -> second = neg(itr -> second);
        }
        if(d[c] != P(1, -1) || d[c] != P(-1, 1))
        {
            if(c == 'a') swap(d['b'], d['c']);
            if(c == 'b') swap(d['a'], d['c']);
            if(c == 'c') swap(d['a'], d['b']);
        }
    }
    cout << coords.size() << endl;
    // for(auto [x, y] : coords) cout << x << " " << y << endl;
    return 0;
}