#include <bits/stdc++.h>
using namespace std;
#define ll long long
#ifdef LOCAL
template<class t,class u>ostream& operator<<(ostream& os,const pair<t,u>& p){return os<<"("<<p.first<<","<<p.second<<")";}
#endif
template<class t>ostream& operator<<(ostream& os,const vector<t>& v){if(v.size())os<<v[0];for(int i=1; i<v.size(); i++)os<<' '<<v[i]; return os;}
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
int n, m, t, k, a, b, c, d, cnt, mark, an, oT_To, x, y, z;
ll ans;

struct Solver {
	void solve() {
        string s;
        cin >> s;
        string sans;
        cnt = 0;
        for (int i = 1; i <= s.size(); ++i) {
            for (int j = 0; j+i < s.size() && cnt < i; ++j) {
                string ss = s.substr(j, i);
                for (int l = j+i; l+i < s.size() && cnt < i; ++l) {
                    string sss = s.substr(l, i);
                    if (ss == sss) {
                        cnt = i;
                        sans = ss;
                    }
                }
            }
        }
        cout << sans << '\n';

	}
};

int main () {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    oT_To = 1;
    cin >> oT_To;
    while (oT_To--) {
    	Solver solver;
        solver.solve();
    }
}