#pragma comment(linker, "/stack:247474112")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") 
#pragma GCC optimize("unroll-loops")
 
#include <bits/stdc++.h>
using namespace std; 
  
#define     pii             pair<int ,int>
#define     ff              first
#define     ss              second
#define     pb(x)           push_back(x)
#define     mp              make_pair
#define     sz(x)           x.size()
#define     clr(x)          x.clear()
#define     mem(x ,y)       memset(x , y , sizeof x )
#define     all(a )         a.begin() , a.end()
#define     endl            "\n"
#define     si(x )          scanf("%d", &x)
#define     sl(x )          scanf("%I64d", &x)
#define     sd(x )          scanf("%lf", &x)
#define     sii(x,y )       scanf("%d%d", &x,&y)
#define     siii(x,y ,z)    scanf("%d%d%d ", &x,&y , &z)
#define     rep(i ,n )      for(int i = 0 ; i < n ; i++ )
#define     repi(i ,n )     for(int i = 1 ; i <= n ; i++ )
#define     forn(i ,x,n )   for(int i = x ; i <= n ; i++ )
#define     ford(i ,x,n )   for(int i = x ; i >= n ; i-- )
#define     repit(i, c)     for( __typeof((c).begin()) i = (c).begin(); i != (c).end();++i )
#define     dbg(args...)    do {   cerr << #args << ' ' ;  print(args); } while(0); cerr<< endl ;
  
typedef long long ll  ;
typedef unsigned long long  ull ;
typedef vector<int> vi  ;
 
const ll  mod =  (ll)1e9+7;
const int    inf = 1e9+7  ;
const long long  infL = 1e18 ;
 
int setbit(int n, int pos  ) { return n = n|(1<< pos) ; }
int resetbit(int n,int pos ) {  return n =  n & ~(1<<pos ); }
bool checkbit(int  n,int pos ) { return (bool ) (n&(1<<pos))  ; }
 
template < typename T > T mul(T x, T y   ) { x %= mod ; y %= mod ; return (x*y)%mod  ;  }
template < typename T > T add(T x, T y  ) { x %= mod ; y %= mod ; return (x+y)%mod ;  }
template < typename T > T modPow(T x, T k ,T mod ) { if(k == 0 ) return 1; if(k&1  ) { return ( (x%mod)*modPow(x,k-1, mod )%mod )%mod ; } else { T ret = modPow(x,k/2 , mod ) ; ret %= mod ; return (ret*ret )%mod; } }
template < typename T > T ext_gcd(T num1 , T num2, T &X , T &Y ) { T r2,r1, q2, q1 , x2, x1, y2 ,y1 , x,  y, r   ; x2 = 1; y2 = 0;  x1 = 0; y1 = 1; for( r2 =num1 ,r1 = num2 ;r1 != 0 ; y2 = y1, y1 = y,x2 = x1 ,x1 = x ,r2 = r1, r1 = r) {q1 = r2/r1; x = x2 - q1*x1; y = y2 - q1*y1; r = r2%r1 ; } X = x2 ; Y = y2 ; return r2 ;  }
template < typename T > void print(const T& v) {    cerr << v << ' ' ;}
template < typename T1, typename... T2 > void print( const T1& first, const T2&... rest ){ print(first); print(rest...) ;}
 
template < typename T > 
T  modInv( T x , T m = 1e9+7) {  
    return modPow(x,m-2 , m) ;   
    // long long ret, t ;// 
    // ext_gcd( x, m ,ret ,t  ) ;
    // ret %= m ; if(ret<0) ret += m  ; 
    // return ret;
} 
 
// debuging ...
template<typename T > 
void dbg_a(T a[] ,int n=10 ) {
    cerr << "[ "; rep(i,n )cerr<<a[i]<<' ' ; cerr<< " ]" <<  endl; 
}
 
template < typename F,  typename S >
ostream& operator << ( ostream& os, const pair< F, S > & p ) {
    return os << "[ " << p.first << ", " << p.second << " ]";
}
 
template < typename T >
ostream &operator << ( ostream & os, const vector< T > &v ) {
    os << "[ "; rep(i , sz( v)  )  os << v[i] << ' ' ; return os << " ]" ; 
}

template < typename T >
ostream &operator << ( ostream & os, const set< T > &s ) {
    os << "[ "; repit(it ,s  )  os << *it  << ' ' ; return os << " ]" ; 
}

template < typename T >
ostream &operator << ( ostream & os, const multiset< T > &s ) {
    os << "[ "; repit(it ,s  )  os << *it  << ' ' ; return os << " ]" ; 
}


//int dx[] = {0 , 0 ,+1, -1 } ;
//int dy[] = {-1, +1,0 , 0 };


ll modAdd(ll &x ,ll  y) {
    x += y ;
    if(x>= mod ) x-=mod; 
    return x ;
}
const int M = (int )1e6  +33;  
const int mx  = 1000+23  ;
 
 
////  code from here ...  

// int kmp[M + 2] ,cnt[M +2 ], n  ;  
// vector<pii> v; 
// int generatekmp(string s ) {
//     s = "-"+ s  ;
//     forn(i, 2,sz(s)-1) {
//         int curr = kmp[i-1] ; 
//         while(curr>0 and s[curr+1] != s[i ] ) curr =  kmp[curr] ; 

//         if(s[i] == s[curr+1] ) kmp[ i] = curr+ 1 ; 


//     }
//     dbg_a(kmp) ;

// }  
// vector<int >v[26];  
// int a[M + 2] ;

// struct Node {
//     int cnt ,flag ;
//     Node*  nxt[2 ] ; 
//     Node()  {   
//        rep(i, 2 ) nxt[i] = 0 ;
//        cnt = flag  = 0; 
//     }
 
// } ;

// struct Trie {
//     Node *head  , *curr ,*dummy ; 
//     Trie() {
//         head = curr = new Node() ;
//     }
//     string getString(int x ) {
//         string s ="" ; 
//         ford(i,30, 0) {
//             if(checkbit(x,i) == 0 )s += '0' ; 
//             else s += '1' ; 

//         }
//         dbg(s ); 
//         return s ;

//     }

//     void  insert(int x ) {
//         string s = getString(x)  ;
//         curr =head; 
//         rep(i ,sz(s ) ){
//             int tmp = s[i ]-'0' ;
//             if(curr->nxt[tmp ] == NULL) {
//                 curr->nxt[tmp ] = new Node() ; 
//             }             


//             curr = curr->nxt[tmp ] ; 
//             curr->cnt++ ; 
//         }



//     }

//     int search(int  x) {
//         string s  = getString(x ) ; 
//         curr = head ;
//         rep(i ,sz(s)   ) {
//             int tmp = s[i] -'0' ; 
//             if( curr->nxt[tmp] == 0 ) return 0 ;  
//             curr = curr ->nxt[tmp] ;  

//         }
//         return (curr->cnt > 0 ) ; 

//     }

//     int solve(int x ){
//         string s = getString(x)  ; 
//         int ans = inf ,x = 0 ; 
//         curr = head ;
//         ford( i, 30 ,0 ) {
//             int tmp = s[i] -'0' ; 

//             if(tmp== 0  ) {
//                 if(curr->nxt[1] == 0 )
//                     ans = min(ans , setbit(x,i) ) ; 
//                 if(curr->nxt[0] == 0 ) {
//                     ans = min(ans , x )  ; 

//                     return ans ;
//                 }

//                 curr = curr-> nxt[tmp] ; 


//             } else {
//                 if(curr->nxt[0] != 0) {

//                     curr = curr->nxt[0] ; 

//                 } else {
//                     ans = min(ans ,x) ;

                    
//                     return ans ;

//                 }



//             }



//         }



//     }
    
// };

string s; 
vector<pair<int,int > > v; 
int func(int id  ) {
    if(s[id]=='B' and s[id+1] == 'C') return 1; 
    return  0  ; 
}

void solve() { 
    int n ,f = 1        ; 
    // 0 -> a  

    cin>> s; 
    s  += "xxxxx" ;
    v.pb(mp(2,2 ) )  ;
    
    rep(i , sz(s ) -2 ) {
        int id = sz(v)-1 ;
        if( s[i]=='B' and func(i )) {
            if( v[id].ff==1  ) v[id].ss++ ; 
            else v.pb(mp(1, 1) ); 

            i++ ;
        } else if(s[i] == 'A' ) {
            if( v[id].ff== 0  ) v[id].ss++ ; 
            else v.pb(mp( 0 , 1) ); 


        } else {
            v.pb( mp(2, 2) ) ; 
        }
        //dbg(i, v  ); 
    }
    ll curr = 0LL , cnt = 0LL ; 
    rep( i , sz(v ) ) {
        if(v[i].ff == 0) {
            curr +=  v[i].ss ;

        } else if(v[i].ff == 1 ) {
            cnt += curr*(v[i].ss*1LL) ;

        } else {
            curr = 0 ;
        }




    }
    cout << cnt ;


}

int main() {
    
    ios::sync_with_stdio(false);  cin.tie(0); cout.tie(0) ;  
    int t=1 , c= 0 ;  
     // cin>>t ;
    while(t--) {
        // printf("Case %d: ",++c ) ; 
        solve() ;

    
    }   
    return 0 ;
       
}

// g++ f.cpp -o f.exe








Measured memory_bytes: 2700