#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <numeric>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define SZ(x) ((int)x.size())
#define fi first
#define se second
const int INF = 1e15;
using namespace std;

template<class T> using vc=vector<T>;
template<class T> using vvc=vc<vc<T>>;

using pi=pair<int,int>;
using vi=vc<int>;

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

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout<<fixed<<setprecision(20);

    set<pi> s;
    string S; cin >> S;
    int x=0,y=0;
    s.insert(pair<int,int>(0,0));
    int ax=1,ay=0;
    int bx=-1,by=0;
    int cx=0,cy=-1;
    rep(i,SZ(S)) {
        if(S[i]=='a') {
            if(ax!=0) {
                x+=ax;
                y+=ay;
                s.insert(pair<int,int>(x,y));
                ax=-ax;
                if(by!=0) {
                    bx=-ax;
                    cy=-by;
                    by=0;
                    cx=0;
                } else {
                    cx=-ax;
                    by=-cy;
                    cy=0;
                    bx=0;
                }
            } else {
                x+=ax;
                y+=ay;
                s.insert(pair<int,int>(x,y));
                ay=-ay;
            }
        } else if(S[i]=='b') {
            if(bx!=0) {
                x+=bx;
                y+=by;
                s.insert(pair<int,int>(x,y));
                bx=-bx;
                if(cy!=0) {
                    cx=-bx;
                    ay=-cy;
                    cy=0;
                    ax=0;
                } else {
                    ax=-bx;
                    cy=-ay;
                    ay=0;
                    cx=0;
                }
            } else {
                x+=bx;
                y+=by;
                s.insert(pair<int,int>(x,y));
                by=-by;
            }
        } else {
            if(cx!=0) {
                x+=cx;
                y+=cy;
                s.insert(pair<int,int>(x,y));
                cx=-cx;
                if(ay!=0) {
                    ax=-cx;
                    by=-ay;
                    ay=0;
                    bx=0;
                } else {
                    bx=-ax;
                    ay=-by;
                    by=0;
                    ax=0;
                }
            } else {
                x+=cx;
                y+=cy;
                s.insert(pair<int,int>(x,y));
                cy=-cy;
            }
        }
    }
    cout << s.size() << endl;
}