#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
const int MAX_S = 100001;
char S[MAX_S],P[MAX_S];
int N;
vector<int> faildfun()
{

        vector<int> pi(N);
        int k=-1;
        for(int i=1;i<N;i++)
        {
                while(k!=-1&&P[i]!=P[k+1])k=pi[k];
                if(P[i]==P[k+1])k++;
                pi[i]=k;
        }

        return pi;
}
int KMP()
{
        vector<int> pi=faildfun();
        int j=-1;

        for(int i=0;i<N;i++) {

                while(j!=-1&&P[j+1]!=S[i])j=pi[j];
                if(P[j+1]==S[i])j++;

        }
        return N-j-1;
}
int main()
{
        int T;
        scanf("%d",&T);
        while(T--)
        {
                scanf("%s",S);
                N=strlen(S);
                for(int i = N-1; i >= 0; i--)P[N-i-1]=S[i];

                printf("%d\n",N+KMP());

        }
        return 0;
}