#include <bits/stdc++.h>
using namespace std;
#define masterspark ios::sync_with_stdio(0), cin.tie(0),cout.tie(0),cin.exceptions(cin.failbit);

template<class F, class S> ostream &operator<<(ostream &s, pair<F, S> v) { return s << "(" << v.first << ", " << v.second << ")";} 
template<class F, class S> istream &operator>>(istream &s, pair<F, S> &v) { return s >> v.first >> v.second; }
template<class T> istream &operator>>(istream &s, vector<T> &a) { for (auto &x:a) s>>x; return s; }
template<class T> ostream &operator<<(ostream &s, vector<T> &a) { int n=a.size(); if (!n) return s; s<<a[0]; for (int i=1; i<n; i++) s<<' '<<a[i]; return s; }
 
#define int long long
#define pp pair<int, int>
#define ff first
#define ss second

#define forr(i,n) for(int i = 1; i <= n;++i)
#define rep(i,j,n) for(int i = j; i < n;++i)
#define PB push_back
#define PF push_front
#define EB emplace_back
#define all(v) (v).begin(), (v).end()
#define FZ(x) memset(x, 0, sizeof(x)) //fill zero
#define SZ(x) ((int)x.size())
bool chmin(auto &a, auto b) { return (b < a) and (a = b, true); }
bool chmax(auto &a, auto b) { return (a < b) and (a = b, true); }
using i128 = __int128_t;
using i64 = int64_t;
using i32 = int32_t;
vector<int> prefunc(const string& s){
	int n = s.size();
	vector<int> pi(n);
	for(int i=1,j=0;i<n;++i){
		j = pi[i-1];
		while(j && s[j] != s[i]) j = pi[j-1]; //取次小LCP
		if(s[j] == s[i]) ++j;
		pi[i] = j;
	}
	return pi;
}
void solve(){
    string str;
    cin >> str;
    int n = str.size();
    int a = 0,b = 0;
    int mi = 0;
    rep(i,0,n){
        for(int j = i; j < n;++j){
            string temp = str.substr(i,j-i+1);
            string tmp = temp+"@"+str;
            // cerr << tmp << '\n';
            int nn = j-i+1;
            auto ret = prefunc(tmp);
            int mx =-1;
            int mn = (nn+n+1);
            for(int i = nn; i < (nn+n+1);++i){
                if(ret[i] == nn) {
                    mn = min(mn,i);
                    mx = max(mx,i);
                }
            }
            if(mx - mn >= nn){
                if(nn > mi){
                    mi = nn;
                    a = i;
                    b = j;
                }
            }
        }
    }
    for(int i = a; i <= b;++i){
        cout << str[i];
    }
    cout << '\n';
}
signed main()
{
    masterspark
    int t = 1;
    // freopen("stdin","r",stdin);
    // freopen("stdout","w",stdout);
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
} 

/*
     /\_/\
    (= ._.)
    / >  \>
*/