#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>using namespace std;const int N = 1e5+100;char a[N];bool judge(int x,int y){int l=0;while(x+l<=y-l){if( a[x+l]==a[y-l] ) l++;else return false;}return true;}int main(){int T;scanf("%d",&T);while(T–){bool flag=0;scanf("%s",a+1);int len=strlen(a+1);for(int i=1;i<=len;i++){if( a[i]==a[len-i+1] ) continue;int j=i;while(a[j-1]==a[i]) j–;for(int k=j;k<=i;k++)if( judge(k+1,len-k+1) ){printf("%d\n",k);flag=1;break;}if(flag) break;if( judge(i,len-i) ){printf("%d\n",len-i+1);flag=1;break;}break;}if(!flag) printf("No Solution\n");}return 0;}
，有多远，走多远，把足迹连成生命线。
