#include <cstdio>
#include <cstring>
#define nmax 1000010

char s[nmax];
int v[2*nmax], n;
long long t;

int min(int a, int b)
{
	if (a>b) a=b;
	return a;
}

int max(int a, int b)
{
	if (a<b) a=b;
	return a;
}

int main()
{
	freopen("pscpld.in","r",stdin);
	freopen("pscpld.out","w",stdout);
	fgets(s,nmax,stdin);
	n=strlen(s)-1;
	int i, k, j, c, x, ck;
	for (i=n; i>0; i--) s[i]=s[i-1];
	for (i=1; i<=n; i++)
	{
		k=v[2*i-1];
		ck=k;
		for (j=k+1; j<=n-i+1 && j<=i; j++)
		{
			if (s[i+j-1]!=s[i-j+1]) break;
			k=j;
		}
		v[2*i-1]=k;
		if (!ck) ck=1;
		for (j=ck; j<k; j++)
		{
			x=i+j-1;
			c=min(v[2*(i-j)],j);
			c=min(c,k-j);
			v[2*x]=max(v[2*x],c);
			
			c=min(v[2*(i-j)-1], j+1);
			c=min(c,k-j);
			v[2*x+1]=max(v[2*x+1],c);
		}
			
		k=v[2*i];
		ck=k;
		for (j=k+1; j<=n-i && j<=i; j++)
		{
			if (s[i+j]!=s[i-j+1]) break;
			k=j;
		}
		v[2*i]=k;
		if (k && !ck)
		{
			c=min(v[2*i-1],1);
			v[2*i+1]=max(v[2*i+1],c);
			ck++;
		}
		for (j=ck; j<k; j++)
		{
			x=i+j;
			c=min(v[2*(i-j)],j);
			c=min(c,k-j);
			v[2*x]=max(v[2*x], c);
			
			c=min(v[2*(i-j)-1], j+1);
			c=min(c, k-j);
			v[2*x+1]=max(v[2*x+1], c);
		}
	}
	for (i=1; i<2*n; i++) t+=v[i];
	printf("%lld\n",t);
}