#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define IOS cin.tie(0);ios_base::sync_with_stdio(false);
#define INF 1e15+9
using namespace std;
const int maxn = 2e5+5;
typedef pair<int,int> P;
void solve(){
    string s;
    cin >> s;
    map <string,bool> mp[s.size() + 5];
    string ans ;
    int mx = 0;
    int le = 0;
    for(int i=0;i<s.size();i++){
        string now = "";
        for(int j=i;j>=0;j--){
            now = s[j] + now;
            for(int k=j-1;k>=0;k--){
                if(mp[k][now]){
                    if(now.size() >= mx){
                        if(now.size() == mx){
                            if(k - now.size() + 1 < le){
                                mx = now.size();
                                ans = now;
                                le = k - now.size() + 1;
                            }
                        }
                        else{
                            mx = now.size();
                            ans = now;
                            le = k - now.size() + 1;
                        }
                        
                    }
                }
            }
            mp[i][now] = true;
        }
    }
    cout << ans << '\n';
}

signed main(){IOS
    int T;
    cin >> T;
    while(T--){
        solve();
    }
}