manacher

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
#define N 10000050
int te,p[N+5];
char s[N+5];
#define EXP_CH '@'
#define EXP_CH_ '$'
int manacher(){
	memset(p,0,sizeof(p));
	int len=strlen(s);
	int Max=0,id=0;
	for(int i=len;i>=0;i--){
		s[i+i+2]=s[i];
		s[i+1+i]=EXP_CH;
	}
	s[0]=EXP_CH_;
	for(int i=2;i<2*len+1;i++){
		if(p[id]+id>i){
			if(p[2*id-i]<p[id]+id-i)p[i]=p[2*id-i];
			else p[i]=p[id]+id-i;
		}else{
			p[i]=1;
		}
		while(s[i-p[i]]==s[i+p[i]]){
			p[i]++;
		}
		if(id+p[id]<i+p[i]){
			id=i;
		}
		if(Max<p[i]){
			Max=p[i];
		}
	}
	return Max-1;
}
int main(){
	scanf("%s",s);
	cout<<manacher();
}