#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define per(i,a,b) for (int i = a; i >= b; i--)
#define pii pair<int,int>
#define fi first
#define se second
const int MAXN = 1e6+10;
const int INF = 1e9+67;
void solve() {
string s; cin >> s;
int n = s.size();
int ans = 0;
int ls = 0;
rep(r,0,n/2-1) {
bool ok = 1;
int j = r;
rep(k,ls,r) {
if(s[k] != s[n-j-1]) {
ok = 0;
break;
}
j--;
}
if(!ok) continue;
ls = r+1;
ans += 2;
}
if(ls <= n/2-1 || n%2==1) ans++;
cout << ans << endl;
}
int32_t main() {
ios_base::sync_with_stdio(0);cin.tie(nullptr);
int tt; cin >> tt;
while (tt--) solve();
}
