#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 10;
char s[maxn], a[maxn];
int p[maxn];
int f, maxlen;
void manacher(int l, int r, char s[]) {
  int k = 0;
  a[k++] = '$';
  a[k++] = '#';
  for (int i = l; i <= r; i++) {
    a[k++] = s[i];
    a[k++] = '#';
  }
  a[k] = '\0';
  int mx = 0, id = 0;
  maxlen = -1;
  for (int i = 1; i < k - 1; i++) {
    p[i] = mx > i ? min(mx - i, p[2 * id - i]) : 1;
    while (a[i - p[i]] == a[i + p[i]]) p[i]++;
    if (i + p[i] > mx) {
      id = i;
      mx = i + p[i];
    }
    if (p[i] > maxlen && i == p[i]) {
      maxlen = p[i] - 1;
      f = 1;
    }
    if (p[i] > maxlen && i + p[i] == k) {
      maxlen = p[i] - 1;
      f = 2;
    }
  }
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    f = 0;
    scanf("%s", s);
    int lenn = strlen(s);
    int l = 0, r = lenn - 1;
    while (s[l] == s[r] && l <= r) {
      l++;
      r--;
    }
    if (l >= r) {
      printf("%s\n", s);
      continue;
    }
    manacher(l, r, s);
    for (int i = 0; i < l; i++) printf("%c", s[i]);
    if (f == 1)
      for (int i = l; i < l + maxlen; i++) printf("%c", s[i]);
    if (f == 2)
      for (int i = r - maxlen + 1; i <= r; i++) printf("%c", s[i]);
    for (int i = r + 1; s[i]; i++) printf("%c", s[i]);
    printf("\n");
  }
  return 0;
}
