#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 1e3 + 5 , MOD = 1e9 + 7 ;


int main()
{
    cin.tie(0);cin.sync_with_stdio(0);
    cout.tie(0);cout.sync_with_stdio(0);

    int t= 1;
    cin >> t;
    while (t--)
    {
        string s;
        cin >> s ;

        int n = (int)s.size() ;

        int l = 1 , r = n/2 , md ;

        string ans = "" ;

        while (l <= r)
        {
            md = (l + r) /2 ;

            bool can = 0 ;

            for(int i =0 ; i+md <= n && !can; i++)
            {
                for(int j = i + md ; j +md <= n; j++)
                {
                    int k =0 ;
                    while (k < md && s[i+k] == s[j+k])k++ ;

                    if(k == md)
                    {
                        can =1 ;
                        ans = s.substr(i , md) ;
                        break;
                    }
                }
            }

            if(can)  l = md+1 ;
            else r = md-1 ;
        }

        cout << ans << "\n" ;
    }

    return 0;
}