#include <bits/stdc++.h>

using namespace std;
#define int long long

struct Hash {

    const int mod = (int) 1e9 + 7;
    const int pr = 31;

    int N;
    vector<int> p, h;

    void init(string s) {
        N = (int) s.size();
        p.resize(N + 1), h.resize(N + 1);
        p[0] = 1;
        for (int i = 1; i <= N; i++) p[i] = (p[i - 1] * pr) % mod;
        for (int i = 0; i < N; i++)
            h[i] = ((i > 0 ? h[i - 1] : 0) + p[i] * (s[i] - 'a' + 1)) % mod;
    }

    int get_hash(int l, int r) {
        return (((h[r] - (l > 0 ? h[l - 1] : 0)) % mod + mod) % mod * p[N - l]) % mod;
    }
};

void solve() {
    string s;
    cin >> s;
    Hash T;
    T.init(s);
    int l = 0, r = (int) s.size() - 1, res = 0;
    while (l <= r) {
        int prev = res;
        for (int i = l; i <= r && (i - l + 1) <= (r - l + 1) / 2; i++) {
            int len = i - l + 1;
            if (T.get_hash(l, i) == T.get_hash(r - len + 1, r)) {
                res += 2;
                l += len, r -= len;
                break;
            }
        }
        if (res == prev) {
            res++;
            break;
        }
    }
    cout << res << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}