// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x,l,r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> {
    vector<T> &data() { return this->c; }
    void clear() { this->c.clear(); }
};
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
const int dx[] = { 1,0,-1,0,1,-1,-1,1 };
const int dy[] = { 0,1,0,-1,1,1,-1,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
// [a,b]
template <class Int> Int rand(Int a, Int b) { static mt19937_64 mt{random_device{}()}; return uniform_int_distribution<Int>(a,b)(mt); }
i64 irand(i64 a, i64 b) { return rand<i64>(a,b); }
u64 urand(u64 a, u64 b) { return rand<u64>(a,b); }
// <<<
constexpr int sgn(int x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }
// >>> Point

template <class T> struct Point {
    T x,y;
    constexpr Point(T x = 0, T y = 0) : x(x), y(y) {}
    constexpr pair<T,T> to_pair() const { return {x,y}; }
    constexpr Point inv() const { return {x/norm(),-y/norm()}; }
    constexpr Point conj() const { return {x,-y}; }
    constexpr T norm() const { return x*x + y*y; }
    constexpr Point rot90(int n = 1) const {
        n %= 4; if (n < 0) n += 4;
        if (n == 1) return *this * Point(0,1);
        if (n == 2) return *this * (-1);
        if (n == 3) return *this * Point(0,-1);
        return *this;
    }
    constexpr Point operator+() const { return *this; }
    constexpr Point operator-() const { return {-x,-y}; }
    constexpr Point operator+(Point const& p) const { return {x+p.x, y+p.y}; }
    constexpr Point operator-(Point const& p) const { return {x-p.x, y-p.y}; }
    constexpr Point operator*(Point const& p) const { return {x*p.x-y*p.y, x*p.y+y*p.x}; }
    constexpr Point operator/(Point const& p) const { return *this * p.inv(); }
    constexpr Point& operator+=(Point const& p) { return *this = *this + p; }
    constexpr Point& operator-=(Point const& p) { return *this = *this - p; }
    constexpr Point& operator*=(Point const& p) { return *this = *this * p; }
    constexpr Point& operator/=(Point const& p) { return *this = *this / p; }
    constexpr friend Point operator*(T const& a, Point const& p) { return Point(a)*p; }
    constexpr friend Point operator/(T const& a, Point const& p) { return Point(a)/p; }
    constexpr T dot(Point const& q) const { return x*q.x + y*q.y; }
    constexpr T cross(Point const& q) const { return x*q.y - y*q.x; }
    constexpr T dot(Point const& p, Point const& q) const { return (p-*this).dot(q-*this); }
    constexpr T cross(Point const& p, Point const& q) const { return (p-*this).cross(q-*this); }
    constexpr bool operator==(Point const& q) const { return sgn(x-q.x) == 0 && sgn(y-q.y) == 0; }
    constexpr bool operator!=(Point const& q) const { return !operator==(q); }

    constexpr friend Point conj(Point const& p) { return p.conj(); }
    constexpr friend T norm(Point const& p) { return p.x*p.x + p.y*p.y; }
    constexpr friend T dot(Point const& p, Point const& q) { return p.dot(q); }
    constexpr friend T cross(Point const& p, Point const& q) { return p.cross(q); }
#ifdef LOCAL
    friend string to_s(Point const& p) { return to_s(p.to_pair()); }
#endif
    friend istream& operator>>(istream& is, Point& p) { return is >> p.x >> p.y; }
    friend ostream& operator<<(ostream& os, Point const& p) { return os << p.x << " " << p.y; }
};

// <<<
using P = Point<int>;
template <class T>
constexpr bool operator<(Point<T> const& p, Point<T> const& q) {
    return p.to_pair() < q.to_pair();
}

int32_t main() {
    string s; cin >> s;

    using A = array<P, 3>;
    set<A> st;
    A a;
    a[0] = { 0, 0 };
    a[1] = { 1, 0 };
    a[2] = { 0, 1 };

    st.insert(a);
    for (char c : s) {
        int i = c-'a';
        a[i] = a[0] + a[1] + a[2] - 2*a[i];
        st.insert(a);
    }

    cout << st.size() << endl;
}