#include<iostream>
#include<string.h>
using namespace std;

static char a[100001];
static char last;
static int point[100001];
static int N;
void serch(int len, int end)
{
    N = 0;
    for (int i = end; i < len ; i++)
    {
        if (last == a[i] && a[len-1 ] == a[i+1])
        {
            point[N] = i;
            N++;
        }
    }
    point[N] = len;

}

int boolen(int len, int ary)
{
    if (len == point[ary]||N==0 ) {
        return 1;
    }

    for (int i = 3; i <= (len - point[ary])/2; i+=2)
    {
        if (a[len - i] != a[point[ary] + i]|| a[len - i-1] != a[point[ary] + i+1])
            return 0;
    }
    return 2;

}
int main()
{
    ios::sync_with_stdio(false);

    int A,temp,len,number;

    cin >> A;
    while (A--)
    {
        cin >> a;
        temp = 0;
        len = strlen(a) - 1;
        last = a[len];
        serch(len, 0);
        if(N==0)
            cout << len * 2 + 1 << "\n";

        for (number = 0; number < N; number++)
        {
            int l = boolen(len, number);
            if (l>0)
            {
                if (l == 2)
                {
                    cout << len + point[number] + 1 << "\n";
                    break;
                }
                if (l== 1)
                {
                    cout << len * 2 + 1 << "\n";
                    break;
                }
            }
        }
        if(number==N&&N!=0)
            cout << len * 2 + 1 << "\n";


    }
}