#include <bits/stdc++.h>
using namespace std;
const long long int big = 10e8 + 11;
bool isPalindrome(string s) {
  int len = s.size();
  len /= 2;
  for (int i = 0, j = s.size() - 1; i < len; i++, j--)
    if (s[i] != s[j]) return false;
  return true;
}
string fun(string s) {
  int len = s.size();
  for (int i = 0; i < len; i++) {
    if (isPalindrome(s)) return s;
    s.pop_back();
  }
  return "";
}
string fun1(string s) {
  int len = s.size();
  for (int i = 0; i < len; i++) {
    if (isPalindrome(s)) return s;
    s = s.substr(1, (s.size() - 1));
  }
  return "";
}
string res;
int flag = 0;
char ch;
string fun2(string s) {
  int len = s.size();
  len /= 2;
  for (int i = 0, j = s.size() - 1; i < len; i++, j--) {
    if (s[i] != s[j]) {
      string s1;
      s1 = s.substr(i, s.size() - (i)*2);
      return s1;
    }
    res += s[i];
  }
  if (s.size() % 2 != 0) {
    ch = s[len];
    flag = 1;
  }
  return "";
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    flag = 0;
    res.clear();
    string s, ans1, ans2, s1;
    cin >> s;
    int len = s.size();
    s1 = fun2(s);
    ans1 = fun(s1);
    ans2 = fun1(s1);
    cout << res;
    if (ans1.size() > ans2.size())
      cout << ans1;
    else
      cout << ans2;
    if (flag) cout << ch;
    reverse(res.begin(), res.end());
    cout << res << "\n";
  }
  return 0;
}
