#include <iostream>
#include <cstdio>
#include <string>

const int MAXN=1000000;
const int BUFF=4096;

using namespace std;

string s;
int z[2*MAXN+5], p=4095;
long long ans=0;
char buff[BUFF];

char getch( )
{
  p++;

  if( p==BUFF )
  {
    p=0;
    fread(buff,1,BUFF,stdin);
  }

  return buff[p];
}

inline int minim( int a, int b )
{
  if( a>b )
    a=b;

  return a;
}

int main()
{
  freopen( "pscpld.in", "r", stdin );
  freopen( "pscpld.out", "w", stdout );

  char c=getch();

  while( c!='\n' )
  {
    s.push_back('*');
    s.push_back(c);

    c=getch();
  }

  s.push_back('*');

  int st=0, dr=0, n=s.size();

  for( int i=1;i<n-1;i++ )
  {
    if( i>dr )
      z[i]=0;
    else
      z[i]=minim(dr-i,z[dr-st+i]);

    while( 0<=i-z[i] && i+z[i]<=n-1 && s[i-z[i]]==s[i+z[i]] )
      z[i]++;

    z[i]--;

    ans+=z[i];

    if( i+z[i]>dr )
    {
      st=i-z[i];
      dr=i+z[i];
    }
  }

  cout<<(ans+n/2)/2;

  return 0;
}