#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }

/* END OF TEMPLATE */

const int base = 311;
const long long mod = 1e9 + 7;

void solve() {
    string s;
    cin >> s;
    int n = s.size();
    s = " " + s;
    int Max = 0, pos = 0;
    string ans = "";
    for (int col = 1; col < n; col++) {
        map<int, bool> mp;
        for (int i = col + 1; i <= n; i++) {
            long long tmp = 0;
            for (int j = i; j <= n; j++) {
                tmp = (tmp * base + s[j] - 'A' + 1) % mod;
                mp[tmp] = true;
            }
        }
        for (int i = 1; i <= col; i++) {
            long long tmp = 0;
            for (int j = i; j <= col; j++) {
                tmp = (tmp * base + s[j] - 'A' + 1) % mod;
                if (Max <= j - i + 1 && mp[tmp]) {
                    if (Max < j - i + 1) {
                        Max = j - i + 1;
                        pos = i;
                        ans = s.substr(i, j - i + 1);
                    }
                    else
                    if (pos > i) {
                        pos = i;
                        ans = s.substr(i, j - i + 1);
                    }
                }
            }
        }
    }
    cout<<ans<<"\n";
}

int main() {
    #ifndef ONLINE_JUDGE
    freopen("test.inp", "r", stdin);
    freopen("test.out", "w", stdout);
    #endif // ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int Q;
    cin >> Q;
    while (Q--) solve();
    return 0;
}