#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
int main()
{char a[1000006];int i,j,k,maxn=0;cin>>a;for(int i=0;a[i]!='\0';i++)a[i]=toupper(a[i]);int len=strlen(a);for(i=0;i<len;i++){for(j=i;j<len;j++){int ok=1;for(k=i;k<=j;k++){if(a[k]!=a[i+j-k]) ok=0;}if(ok)maxn=max(maxn,j-i+1);}}cout<<maxn<<endl;return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
int max(int a,int b){return a>b?a:b;
}
int main()
{char a[1000006];int n;cin>>n;while(n--){int i,j,maxn=0,len;cin>>a;len=strlen(a);for(i=0;i<len;i++){for(j=0;i-j>=0 && i+j<len;j++){if(a[i-j]!=a[i+j]) break;else maxn=max(maxn,j*2+1);}for(j=0;i-j>=0 && i+j+1<len;j++){if(a[i-j]!=a[i+j+1]) break;else maxn=max(maxn,j*2+2);}}cout<<maxn<<endl;}return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
int p[2000006];
char a[2000006];
int main()
{while(cin>>a){memset(p,0,sizeof(p));int len=strlen(a),id=0,maxlen=0;for(int i=len;i>=0;--i){a[(i<<1)+1]='#';a[(i<<1)+2]=a[i];}　　　　　a[0]='#';for(int i=2;i<2*len-1;i++){if(p[id]+id>i) p[i]=min(p[id*2-i],p[id]+id-i);else p[i]=1;while(a[i-p[i]]==a[i+p[i]]) ++p[i];if(id+p[id]<i+p[i])id=i;if(maxlen<p[i])maxlen=p[i];}cout<<maxlen-1<<endl;}return 0;
}