#include "bits/stdc++.h"

using ll = long long;
using namespace std;

struct hasher {
    static constexpr int mod = 1'000'000'007;
    static constexpr int p = 43;
    
    vector<int> pow;
    vector<int> val;
    int n;

    hasher(string s) {
        n = (int)s.size();

        pow.resize(n + 1);
        pow[0] = 1;

        for (int i = 1; i <= n; i++) {
            pow[i] = 1ll * pow[i - 1] * p % mod;
        }

        val.resize(n + 1);
        for (int i = 1; i <= n; i++) {
            val[i] = (ll)(s[i - 1] - 'a' + 1) * pow[i] % mod;
            val[i] += val[i - 1];
            
            if (val[i] >= mod) {
                val[i] -= mod;
            }
        }
    }

    int get(int l, int r) const {
        int res = val[r + 1] - val[l] + mod;
        if (res >= mod) {
            res -= mod;
        }

        return 1ll * res * pow[n - r - 1] % mod;
    }
};

void solve() {
    string s;
    cin >> s;

    hasher h(s);

    int n = (int)s.size();

    int l = 0, r = n - 1;

    int ans = 0;

    while (l <= r) {
        bool ok = false;

        for (int k = 1; k < r - l + 1; k++) {
            if (l + k - 1 < r - k + 1 && h.get(l, l + k - 1) == h.get(r - k + 1, r)) {
                l += k;
                r -= k;
                ans += 2;
                ok = true;
                break;
            }
        }

        if (!ok) {
            ans += 1;
            break;
        }
    }

    cout << ans << '\n';
}

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#endif

    int t;
    cin >> t;

    while (t--) {
        solve();
    }
    return 0;
}