#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int nmax=3000006;
char a[nmax],b[nmax];
int p[nmax];
int mar,n=-1;
int main()
{
    freopen ("pscpld.in","r",stdin);
    freopen ("pscpld.out","w",stdout);
    scanf("%s",b);
    mar=strlen(b);
    for(int i=0;i<mar;i++)
    {
        a[++n]='#';
        a[++n]=b[i];
    }
    a[++n]='#';
    int c=0,r=0;
    for(int i=1;i<=n;i++)
    {
        int mirr=2*c-i;
        if(i<r) p[i]=min(p[mirr],r-i);
        while(1)
        {
            if(i-p[i]-1<0) break;
            if(i+p[i]+1>n) break;
            if(a[i+p[i]+1]!=a[i-p[i]-1]) break;
            ++p[i];
        }
        if(i+p[i]>r)
        {
            c=i;
            r=i+p[i];
        }
    }
    int sum=0;
    for(int i=0;i<=n;i++)
    {
        if(i%2==1) sum+=p[i]/2;
        else sum+=(p[i]+1)/2;
    }
    sum+=mar;
    printf("%d\n",sum);
    return 0;
}