#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

int n ;
string a ;

bool eq ( int i , int j , int len ) {
    for ( int k = 0 ; k < len ; ++ k ) {
        if ( a[ i + k ] != a[ j + k ] ) { return false ; }
    }
    return true ;
}

int f ( int len ) {
    for ( int i = 0 ; i + len - 1 < n ; ++ i ) {
        for ( int j = i + len ; j + len - 1 < n ; ++ j ) {
            if ( eq ( i , j , len ) == true ) { return i ; }
        }
    }
    return -1 ;
}

void solve ( ) {
    cin >> a ;
    n = a.size ( ) ;
    int l , r , mid ;
    l = 1 , r = n / 2 ;
    while ( l < r ) {
        mid = ( l + r + 1 ) / 2 ;
        int ret = f ( mid ) ;
        if ( ret == -1 ) { r = mid - 1 ; }
        else { l = mid ; }
    }
    int pos = f ( l ) ;
    for ( int i = 0 ; i < l ; ++ i ) {
        cout << a[ pos + i ] ;
    }
    cout << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; cin >> t ; 
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}