#include <bits/stdc++.h>

using namespace std;
string s, a;
int ans[2000001], st, dr, mij, sum;
ifstream fin("pscpld.in");
ofstream fout("pscpld.out");
int main()
{
    fin >> a;
    s += '!';
    for(int i = 0; i  < a.size(); ++ i)
    {
        s += a[i];
        s += '!';
    }
    st = -1;
    dr = -1 ;
    for(int i = 1; i < s.size() - 1; ++ i)
    {
        if(i <= dr)
        {
            ans[i] = max(0, min(dr - i, ans[st + dr - i]));
        }
        while(s[i - ans[i]] == s[i + ans[i]])
        {
            ans[i]++;
        }
        if(i + ans[i]> dr)
        {
            dr = i + ans[i];
            st = i - ans[i];
        }
    }
    for(int i = 0; i < s.size(); i ++)
        sum += ans[i] / 2;
    fout << sum;
    return 0;
}