#include <bits/stdc++.h>
using namespace std;
const char NL = '\n';
clock_t startTime;
double getCurrentTime() {
  return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}
void readarray(vector<long long int> &a) {
  for (auto &it : a) cin >> it;
}
bool is_plain(string s) {
  long long int st = 0, e = s.length() - 1;
  while (st < e) {
    if (s[st] != s[e]) return false;
    st++, e--;
  }
  return true;
}
string find_l(string s) {
  long long int n = s.length();
  string res = "";
  for (long long int i = 1; i < n + 1; i++) {
    string tmp = s.substr(0, i);
    if (is_plain(tmp)) {
      if (tmp.length() > res.length()) res = tmp;
    }
  }
  return res;
}
void solve() {
  long long int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    string f = "", b = "";
    long long int st = 0, e = s.length() - 1;
    long long int n = s.length();
    while (st <= e) {
      if (st == e) {
        f += s[st];
        break;
      }
      if (s[st] == s[e]) {
        f += s[st], b += s[e];
      } else
        break;
      st++, e--;
    }
    reverse(b.begin(), b.end());
    if (st < e) {
      string res1 = find_l(s.substr(st, abs(e - st) + 1));
      string tmp = s.substr(st, abs(e - st) + 1);
      reverse(tmp.begin(), tmp.end());
      string res2 = find_l(tmp);
      if (res1.length() >= res2.length()) {
        cout << f + res1 + b << NL;
      } else {
        reverse(res2.begin(), res2.end());
        cout << f + res2 + b << NL;
      }
    } else
      cout << f + b << NL;
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  startTime = clock();
  solve();
  fflush(stdin);
  fflush(stdout);
  return 0;
}
