#include <bits/stdc++.h> #define int long long #define debug cout << "ok\n"; #define SQR(x) (1LL * ((x) * (x))) #define MASK(i) (1LL << (i)) #define BIT(x, i) (((x) >> (i)) & 1) #define fi first #define se second #define pb push_back #define mp make_pair #define pii pair<int,int> #define pli pair<ll,int> #define vi vector<int> #define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef unsigned int ui; using namespace std; const int M = 1e9 + 7; const int INF = 1e9 + 7; const ll INFLL = (ll)2e18 + 7LL; const ld PI = acos(-1); const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1}; const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1}; template<class _, class __> bool minimize(_ &x, const __ y){ if(x > y){ x = y; return true; } else return false; } template<class _, class __> bool maximize(_ &x, const __ y){ if(x < y){ x = y; return true; } else return false; } template<class _,class __> void Add(_ &x, const __ y) { x += y; if (x >= M) { x -= M; } return; } template<class _,class __> void Diff(_ &x, const __ y) { x -= y; if (x < 0) { x += M; } return; } //-------------------------------------------------------------- const int base = 31; int mul(int a,int b) { return 1LL*a*b%M; } string s; void sol() { cin >> s; int l = 0, r = (int)s.length()-1; int tmp = 1; int hash1 = 0; int hash2 = 0; int res = 0; while (l < r) { hash1 = mul(hash1,base); Add(hash1,s[l] - 'a' + 1); Add(hash2,mul(tmp,s[r] - 'a' + 1)); tmp = mul(tmp,base); if (hash1 == hash2) { res += 2; hash1 = 0; hash2 = 0; tmp = 1; } l++; r--; } if (l == r || hash1 != 0) { res++; } cout << res << '\n'; } signed main() { // freopen("test.inp","r",stdin); // freopen("test.out","w",stdout); FAST int t=1; cin >> t; while (t--) sol(); }