using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <cctype>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <iomanip>
#include <fstream>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define oo 1<<30
#define f first
#define s second
#define II inline
#define db double
#define ll long long
#define pb push_back
#define mp make_pair
#define Size(V) ((int)(V.size()))
#define all(v) v.begin() , v.end()
#define CC(v) memset((v),0,sizeof((v)))
#define CP(v,w) memcpy((v),(w),sizeof((w)))
#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);++(i))
#define REP(i, N) for (int (i)=0;(i)<(int)(N);++(i))
#define FORit(it, x) for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); ++it)

#define IN "pscpld.in"
#define OUT "pscpld.out"
#define N_MAX (1<<20)

typedef vector<int> VI;
typedef pair<int,int> pi;
typedef vector<string> VS;
template<class T> string toString(T n) {ostringstream ost;ost<<n;ost.flush();return ost.str();}

int N,C[N_MAX];
char S[N_MAX];

II void scan()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	
	fgets(S+1,N_MAX,stdin);
	for(int i = 1;S[i] != '\n' && S[i] != '\0';N = i,++i);
}

II void solve()
{
	int rez(0),last(0),step(0),x,ind;
	
	//pali impare
	FOR(i,1,N)
		if(step < i)
		{
			for(step = i;step < N && S[step + 1] == S[i - (step - i) - 1];++step);
			last = i;
			
			C[i] = 1 + step - i;
		}
		else
		{
			x = last - (i - last);
			ind = i + min(C[x] - 1, x - (last - C[last] + 1) );
			
			for(;ind < N && i - (ind - i) > 1 && S[ind + 1] == S[i - (ind - i) - 1];++ind);
			
			if(ind > step)
			{
				step = ind;
				last = i;
			}
			
			C[i] = 1 + ind - i;
		}
	
	FOR(i,1,N)
	{
		rez += C[i];
		//printf("%d ",C[i] * 2 - 1);
	}
	//printf("\n");
	
	last = 0;
	step = 1;
	CC(C);
	
	//pali pare
	FOR(i,2,N)
		if(step <= i)
		{
			for(step = i;step <= N && S[step] == S[i - (step - i) - 1];++step);
			last = i;
			
			C[i] = step - i;
		}
		else
		{
			x = last - (i - last);
			ind = i + min(C[x], x - (last - C[last] + 1) + 1 );
			
			for(;ind <= N && i - (ind - i) > 1 && S[ind] == S[i - (ind - i) - 1];++ind);
			
			if(ind > step)
			{
				step = ind;
				last = i;
			}
			
			C[i] = ind - i;
		}
	
	//printf("0 ");	
	FOR(i,2,N)
	{
		rez += C[i];
		//printf("%d ",C[i] * 2);
	}
	//printf("\n");
	
	printf("%d\n",rez);
	
	//fprintf(stderr,"Time %d ms\n",clock() );
}

int main()
{
	scan();
	solve();
	return 0;
}