#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;
template<class A, class B>
bool maximize(A& x, B y) {
if (x < y) return x = y, true; else return false;
}
template<class A, class B>
bool minimize(A& x, B y) {
if (x > y) return x = y, true; else return false;
}
/* END OF TEMPLATE */
const int N = 1e6 + 7;
const ll mod = 1e9 + 427;
const ll base = 311;
int dp[N], n;
ll h[N], p[N];
string s;
void buildHash() {
p[0] = 1;
h[0] = 0;
FOR(i, 1, n) {
p[i] = p[i - 1] * base % mod;
h[i] = (h[i - 1] * base + s[i] - 'a' + 1) % mod;
}
}
ll getHash(int i, int j) {
return (h[j] - h[i - 1] * p[j - i + 1] + mod * mod) % mod;
}
void solve() {
cin>>s;
n = s.size();
s = " " + s;
buildHash();
int l = 1, r = n;
int res = 0;
while (l <= r) {
if (l == r) {
res++;
break;
}
bool tmp = true;
FOR(i, 1, (r - l + 1) / 2)
if (getHash(l, l + i - 1) == getHash(r - i + 1, r)) {
res+=2;
tmp = false;
l+=i;
r-=i;
break;
}
if (tmp) {
res++;
break;
}
}
cout<<res<<"\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int q;
cin>>q;
while (q--) solve();
return 0;
}
