#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
bool chk(string s) {
  int l = s.size();
  for (int i = 0, j = l - 1; i <= j; i++, j--) {
    if (s[i] != s[j]) return false;
  }
  return true;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    string ans;
    int mx = 0;
    string res;
    for (int i = 0; i < s.size(); i++) {
      ans += s[i];
      if (chk(ans)) {
        int l = ans.size();
        if (l > mx) {
          mx = ans.size();
          res = ans;
        }
      }
    }
    ans = "";
    for (int i = s.size() - 1; i >= 0; i--) {
      ans += s[i];
      if (chk(ans)) {
        int l = ans.size();
        if (l > mx) {
          mx = ans.size();
          res = ans;
        }
      }
    }
    int p1 = 0;
    int p2 = 0;
    for (int i = 0, j = s.size() - 1; i < j; i++, j--) {
      if (s[i] != s[j]) {
        p1 = i - 1;
        p2 = j + 1;
        break;
      }
    }
    ans = "";
    string rev = "";
    for (int i = 0; i <= p1; i++) ans += s[i];
    for (int i = p2; i < s.size(); i++) rev += s[i];
    string ss = "";
    for (int i = p1 + 1; i < p2; i++) {
      ss += s[i];
      string tmp = ans + ss + rev;
      int l = tmp.size();
      if (l <= mx) continue;
      if (chk(tmp)) {
        if (l > mx) {
          mx = l;
          res = tmp;
        }
      }
    }
    ss = "";
    for (int j = p2 - 1; j > p1; j--) {
      ss = s[j] + ss;
      string tmp = ans + ss + rev;
      int l = tmp.size();
      if (chk(tmp)) {
        if (l > mx) {
          mx = l;
          res = tmp;
        }
      }
    }
    cout << res << endl;
  }
  return 0;
}
