#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>

typedef long long ll;
typedef std::pair<int, int> Pii;
typedef std::pair<long long, long long> Pll;
typedef std::pair<double, double> Pdd;

#define rip(i, n, ss) for (int i = (ss);i < (int)( n ); i++)
#define all(l) l.begin(), l.end()
#define MM << " " <<

template<typename T>
using MaxHeap = std::priority_queue<T>;
template<typename T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;

template<typename T>
inline bool chmax(T &l, const T b) {
    if (l < b) {
        l = b;
        return true;
    }
    return false;
}
template<typename T>
inline bool chmin(T &l, const T b) {
    if (l > b) {
        l = b;
        return true;
    }
    return false;
}

# ifdef LOCAL_DEBUG
template<typename T>
void vdeb(const std::vector<T> &bb) {
    for (unsigned int i = 0;i < bb.size();i++) {
        if (i == bb.size() - 1) std::cout << bb[i];
        else std::cout << bb[i] << ' ';
    }
    std::cout << '\n';
}
template<typename T>
void vdeb(const std::vector<std::vector<T>> &bb) {
    for (unsigned int i = 0;i < bb.size();i++) {
        std::cout << i << ' ';
        vdeb(bb[i]);
    }
    std::cout << '\n';
}
# endif

using namespace std;

struct Tri{
    Pii cent;
    int num;
    void move(char c) {
        if(c == 'b') {
            if(num&1) {
                num++;
                if(num == 6) num = 0;
            }
            else {
                num--;
                if(num == -1) num += 6;
            }
        }
        else if(c == 'c') {
            if(num&1) {
                num--;
                if(num == -1) num += 6;
            }
            else {
                num++;
                if(num == 6) num = 0;
            }
        }
        else if(c == 'a') {
            if(num == 0) {
                cent.first++;
            }
            else if(num == 1) {
                cent.second++;
            }
            else if(num == 2) {
                cent.first--;
                cent.second++;
            }
            else if(num == 3) {
                cent.first--;
            }
            else if(num == 4) {
                cent.second--;
            }
            else if(num == 5) {
                cent.first++;
                cent.second--;
            }
            num += 3;
            if(num >= 6) {
                num %= 6;
            }
        }
    } 
};

bool operator<(const Tri &x, const Tri &y) {
    if(x.num == y.num) return x.cent < y.cent;
    else return x.num < y.num;
}

int main() {
    string s; cin >> s;
    Tri x = {{0, 0}, 0};
    set<Tri> st;
    st.insert(x);
    for(auto i: s) {
        x.move(i);
        st.insert(x);
    }
    cout << st.size() << endl;
}