#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

long long factorial(long long n); //Factorial
long long factorial(long long n, long long x ); // Factorial with modulo
bool isPowerOfTwo (long long x); //Function to check if x is power of 2
long long binpow(long long a, long long b); // return a ^ b
long long binpow(long long a, long long b, long long m); // return (a^b) mod m
long long lcm (long long a, long long b); // least common multiple
long long gcd(long long a, long long b, long long& x, long long& y); //extended euclidean algorithm
pair<long long, long long> fib (long long n); // n-th and (n+1)-th Fibonacci numbers
//dfs
long long mostSignificantDigit(long long N );
long long numberOfDigits(long long N );







typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<pair<int,int>> pi;
typedef vector<pair<long long,long long>> pll;


#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define REPA(i,a,b,c) for (int i = a; i <= b; i+=c)


//TRICKS

//Checking if the number is even or odd without using the % operator:
/*
if (num & 1) 
	cout << "ODD"; 
else
	cout << "EVEN"; 
*/

//emplace_back() instead of push_back()
/*
// are all of the elements positive?
all_of(first, first+n, ispositive()); 

// is there at least one positive element?
any_of(first, first+n, ispositive());

// are none of the elements positive?
none_of(first, first+n, ispositive()); 


Copy Algorithm: used to copy elements from one container to another.
// copy 5 elements from source to target
copy_n(source, sizeOfArray, target);

Initialization in Binary form
auto number = 0b011; 
cout << number;
OUTPUT: 3

*/



const int N_MAX = 300123;
int a [ N_MAX ];
int b [ N_MAX ];
int c [ N_MAX ];


string s;
int n;

ll res;

int main() {
	ios_base::sync_with_stdio(0);
    
    cin >> s;
    n = s.size();
    s = '#' + s;
    

    for ( int i = 1; i <= n; i++ ) {
        if ( s [ i ] == 'a' ) {
            a [ i ] = 1;
        }
        else if ( s [ i ] == 'b' ) {
            b [ i ] = 1;
        }
        else {
            c [ i  ] = 1;
        }
        a [ i ] += a [ i - 1 ];
        b [ i ] += b [ i - 1 ];
        c [ i ] += c [ i - 1 ];
    }
    /*
    for ( int i = 1; i <= n; i++ ) {
        cout << a [ i ] << ' ';
    }
    cout << '\n';
    for ( int i = 1; i <= n; i++ ) {
        cout << b [ i ] << ' ';
    }
    cout << '\n';
    for ( int i = 1; i <= n; i++ ) {
        cout << c [ i ] << ' ';
    }
    cout << '\n';
    for ( int i = 1; i <= n; i++ ) {
        cout << s [ i ] << ' ';
    }
    cout << '\n';
    */


    for ( int i = 1; i <= n; i++ ) {
        for ( int j = i; j <= n; j++ ) {
            int sumA = a [ j ] - a [ i - 1 ];
            int sumB = b [ j ] - b [ i - 1 ];
            int sumC = c [ j ] - c [ i - 1 ];
            int maxValue = max({sumA,sumB,sumC});
            
            if(maxValue == 0) {
                res++;
                /*
                for ( int k = i; k <= j; k++ ) {
                    cout << s[k];
                }
                cout << '\n';
                */
            }
            else {
                if ( (sumA != 0 && sumA != maxValue) ) {

                }
                else if ( (sumB != 0 && sumB != maxValue) ) {

                }
                else if ( (sumC != 0 && sumC != maxValue) ) {

                }
                else {
                    res++;
                    /*
                    for ( int k = i; k <= j; k++ ) {
                        cout << s[k];
                    }
                    cout << '\n';
                    */
                }

            }
            
        }

    }

    cout << res << '\n';
    

	return 0;
}













long long factorial(long long n) 
{ 
    if (n == 0) 
        return 1; 
    return n * factorial(n - 1); 
} 

long long factorial(long long n, long long x ) {
    ll res = 1;
    for ( ll i = 1; i <= n; i++ ) {
        res *= i;
        res %= x;
    }
    return res;
}




// return a ^ b
long long binpow(long long a, long long b) {
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}

// return (a^b) mod m
long long binpow(long long a, long long b, long long m) {
    a %= m;
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}
// least common multiple
long long lcm (long long a, long long b) {
    return a / __gcd(a, b) * b;
}
//extended euclidean algorithm
long long gcd(long long a, long long b, long long& x, long long& y) {
    x = 1, y = 0;
    long long x1 = 0, y1 = 1, a1 = a, b1 = b;
    while (b1) {
        long long q = a1 / b1;
        tie(x, x1) = make_tuple(x1, x - q * x1);
        tie(y, y1) = make_tuple(y1, y - q * y1);
        tie(a1, b1) = make_tuple(b1, a1 - q * b1);
    }
    return a1;
}
// n-th and (n+1)-th Fibonacci numbers
pair<long long, long long> fib (long long n) {
    if (n == 0)
        return {0, 1};

    auto p = fib(n >> 1);
    long long c = p.first * (2 * p.second - p.first);
    long long d = p.first * p.first + p.second * p.second;
    if (n & 1)
        return {d, c + d};
    else
        return {c, d};
}

//dfs
/*
void dfs(int v ) {
    visited[v] = true;
    for (int i = 0; i < (int) G [ v ].size(); i++ ) {
    	int u = G [ v ] [ i ];
        if (!visited[u])
            dfs(u);
    }
}
*/

//bfs
/*




*/


/* Function to check if x is power of 2*/
bool isPowerOfTwo (long long x) 
{ 
  /* First x in the below expression is  
    for the case when x is 0 */
  return x && (!(x&(x-1))); 
} 

long long mostSignificantDigit(long long N ) {
	long double K = log10(N);
	K = K - floor(K);
	long long X = pow(10, K);
	return X;
}
long long numberOfDigits(long long N ) {
	N = floor(log10(N)) + 1;
	return N;
}