#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mod=998244353;
const int p=29;

const int mxn=1e6+1;

int ksm(int a, int b=mod-2) {
	int res=1,aux=a;
	for (int i=1; i<=b; i*=2) {
		if (i&b) {res=res*aux%mod;}
		aux=aux*aux%mod;
	}
	return res;
}

int pw[mxn], ipw[mxn];

int n, hv[mxn];

int hashval(int l, int r) {
	int h = (hv[r+1]-hv[l]+mod)%mod;
	return (h*ipw[l])%mod;
}

int svf(int L, int R) {
	if (L==R+1) return 0;
	if (L>R) return -1;
	for (int le = 0; le<=(R-L); le++) {
		if (hashval(L,L+le)==hashval(R-le,R)) {
			return 2+svf(L+le+1,R-le-1);
		}
	}
	assert(0);
}

void solve() {
	string s; cin>>s;
	n=sz(s);
	for (int i=0; i<n; i++) {
		hv[i+1] = (hv[i] + pw[i]*(s[i]-'a'+1))%mod;
	}
	cout<<svf(0,n-1)<<"\n";
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	pw[0]=1; ipw[0]=1;
	for (int i=1; i<mxn; i++) {
		pw[i]=pw[i-1]*p%mod;
		ipw[i]=ksm(pw[i]);
	}
	
	int t; cin>>t;
	while (t--) {
		solve();
	}
	
	return 0;
}