#include <iostream>
#include <fstream>

const int MAXN = 30000 + 5;

using namespace std;

ifstream in("pscpld.in");
ofstream out("pscpld.out");

string s;
int n;
bool dp[MAXN][MAXN];

void afis(int i,int j){
    for(int k = i; k <= j; k++)
        cout<<s[k];
    cout<<endl;
}

int main()
{

    in.tie(NULL);
    out.tie(NULL);
    ios::sync_with_stdio(false);
    in>>s;
    int n = s.size();
    int i = 0;
    long long ans = 0;
    while(i < n){
        int j = i;
        int copiei = i;
        while(i >= 0 and j < n and s[i] == s[j]){
            i--;
            j++;
            ans++;
        }
        i = copiei;
        j = i + 1;
        while(i >= 0 and j < n and s[i] == s[j]){
            i--;
            j++;
            ans++;
        }
        i = copiei;
        i++;
    }

    out<<ans;
    return 0;
}