#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pt = pair<int, int>;
using vi = vector<int>;
#define sz(x) (int)size(x)
#define all(x) begin(x), end(x)
#define endl '\n'
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define lowbit(x) (x) & (-x)
const int mod = 1e9 + 7;

inline void solve() {
  string s;
  cin >> s;
  int n = sz(s);
  string ans = "";
  for (int i = 0; i < n; ++i)
    for (int j = i + 1; j < n; ++j) {
      string tmp = "";
      for (int k = 0; i + k < j && max(i, j) + k < n; ++k) {
        if (s[i + k] != s[j + k]) break;
        tmp += s[i + k];
      }
      if (sz(ans) < sz(tmp))
        ans = tmp;
    }
  cout << ans << endl;
  return;
}

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