#include "bits/stdc++.h"

using ll = long long;
using namespace std;

struct node {
    int go[26];
    int suff = -1;
    int len = 0;

    node() {
        fill(go, go + 26, -1);
    }
};

vector<node> tree;

int new_node() {
    tree.emplace_back();
    return (int)tree.size() - 1;
}

int add(int a, int x) {
    int b = new_node();
    
    tree[b].suff = 0;
    tree[b].len = tree[a].len + 1;

    for (; a != -1 && tree[a].go[x] == -1; a = tree[a].suff) {
        tree[a].go[x] = b;
    }

    if (a != -1) {
        int c = tree[a].go[x];

        if (tree[c].len == tree[a].len + 1) {
            tree[b].suff = c;
        } else {
            int d = new_node();
            tree[d].suff = tree[c].suff;
            for (int i = 0; i < 26; i++) {
                tree[d].go[i] = tree[c].go[i];
            }
            tree[d].len = tree[a].len + 1;

            tree[c].suff = d;
            tree[b].suff = d;

            for (; a != -1 && tree[a].go[x] == c; a = tree[a].suff) {
                tree[a].go[x] = d;
            }
        }
    }

    return b;
}

void solve() {
    tree.resize(0);

    string s;
    cin >> s;

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

    int x = new_node();

    for (int i = 0; i < n; i++) {
        x = add(x, s[i] - 'a');
    }

    s = "$" + s;

    vector<int> suff(n + 1);
    for (int i = 1; i <= n; i++) {
        suff[i] = tree[suff[i - 1]].go[s[i] - 'a'];
    }


    vector<vector<int>> g(tree.size());
    for (int u = 1; u < tree.size(); u++) {
        g[tree[u].suff].push_back(u);
    }

    vector<int> tin(tree.size());
    vector<int> tout(tree.size());

    int timer = 0;

    auto dfs = [&](auto &&dfs, int u) -> void {
        tin[u] = timer++;
        for (int v : g[u]) {
            dfs(dfs, v);
        }
        tout[u] = timer++;
    };

    dfs(dfs, 0);

    auto is_ancestor = [&](int u, int v) -> bool {
        return tin[u] <= tin[v] && tout[v] <= tout[u];
    };

    int l = 1, r = n;

    int ans = 0;

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

        int u = 0;

        for (int k = 1; l + k - 1 < r - k + 1; k++) {
            u = tree[u].go[s[l + k - 1] - 'a'];
            if (is_ancestor(u, suff[r]) && is_ancestor(u, suff[l + k - 1])) {
                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;
}