#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5 + 100;
char s[MAXN];
int t;
bool check(int l, int r) {
  while (l <= r) {
    if (s[l] != s[r]) return false;
    l++;
    r--;
  }
  return true;
}
void out(int l, int r) {
  for (int i = l; i <= r; i++) {
    cout << s[i];
  }
}
int main() {
  scanf("%d", &t);
  while (t--) {
    int pos1 = 0, ans1 = 0, pos2 = 0, ans2 = 0;
    scanf("%s", s + 1);
    int l = 0, r = strlen(s + 1) + 1, len = strlen(s + 1);
    if (len == 1)
      printf("%s\n", s + 1);
    else {
      while (s[l + 1] == s[r - 1] && l < len / 2) l++, r--;
      pos1 = l;
      for (int i = l + 1; i < r; i++) {
        if (check(l + 1, i)) {
          if (i - l > ans1) {
            ans1 = i - l;
            pos1 = i;
          }
        }
      }
      pos2 = r;
      for (int i = r - 1; i > l; i--) {
        if (check(i, r - 1)) {
          if (r - i > ans2) {
            ans2 = r - i;
            pos2 = i;
          }
        }
      }
      if (ans1 >= ans2) {
        out(1, pos1);
        out(r, len);
        puts("");
      } else {
        out(1, l);
        out(pos2, len);
        puts("");
      }
    }
  }
  return 0;
}
