#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using str = string;
#define reps(i, a, n) for (ll i = (a); i < ll(n); i++)
#define rep(i, n) reps(i, 0, n)

void solve() {
    str S;
    cin >> S;
    ll N = S.size();
    str ans;
    rep(i, N) {
        reps(j, i + 1, N + 1) {
            reps(k, j, N) {
                if (N - k < j - i) break;
                bool f = true;
                rep(l, j - i) {
                    if (S[i + l] != S[k + l]) {
                        f = false;
                        break;
                    }
                }
                if (f) {
                    if (ans.size() < j - i)
                        ans = str(S.begin() + i, S.begin() + j);
                }
            }
        }
    }
    // TATCGATCGAGTTGT
    cout << ans << endl;
}

int main() {
    ll t = 1;
    cin >> t;
    rep(i, t) solve();
}