#include<bits/stdc++.h>
#define ll long long
using namespace std;
#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
const int N = 500009;
const int mod = 1000000000 + 7;
inline ll read(){
	ll s = 0;
	bool w = 0;
	char ch = getchar();
	while(!isdigit(ch)){
		if(ch == '-')w = 1;
		ch = getchar();
	}
	while(isdigit(ch)){
		s *= 10, s += ch ^ 48;
		ch = getchar();
	}
	return w ? -s : s;
}

void solve(){
	string s;
	cin >> s;
	int n = s.length();
	int l0 = 0, r0 = 0;
	for(int i = 0; i < n; ++ i){
		for(int j = i + 1; j < n; ++ j){
			int x = i, y = j;
			while(x < j && y < n && s[x] == s[y])
				++ x, ++ y;
			if(r0 - l0 < y - j){
				r0 = y, l0 = j;
			}
		}
	}
	for(int i = l0; i < r0; ++ i){
		putchar(s[i]);
	}
	putchar('\n');
}

int main(){
	int T = read();
	while(T --){
		solve();
	}
}