/*
 * author: weiyutang
 */

#include <bits/stdc++.h>
using namespace std;

/* ===== BEGIN USER CODE ===== */

#define ll long long
#define ld long double
#define f first
#define s second

const int MOD = 1e9 + 7;
const vector<vector<int>> dirs4 {{0,1}, {1,0}, {-1,0}, {0,-1}};
const vector<vector<int>> dirs8 {{0,1}, {1,0}, {-1,0}, {0,-1}, {-1,-1}, {-1,1}, {1,-1}, {1,1}};

void solve() {
    string st;
    cin >> st;
    int n = st.size();

    for (int l = n / 2; l > 0; l--) {
        for (int i = 0; i + l - 1 < n; i++) {
            for (int i2 = i + l; i2 + l - 1 < n; i2++) {
                // check if every characters are the same
                bool same = true;
                for (int k = 0; k < l; k++) {
                    if (st[i+k] != st[i2+k]) {
                        same = false;
                        break;
                    }
                }

                if (same) {
                    for (int k = 0; k < l; k++) cout << st[i + k]; 
                    cout << endl;
                    return;
                }
            }
        }
    }
    cout << "Not found" << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    srand(chrono::steady_clock::now().time_since_epoch().count());

    int t = 1;
    cin >> t;

    while (t--) {
        solve();
    }

    cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl; 
    return 0;
}