#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 6;
char s[maxn], a[maxn], b[maxn];
struct Manacher {
  int r[maxn << 1];
  void build(string s) {
    int len = s.size();
    string tem = "$#";
    for (long long i = 0; i <= (long long)len - 1; ++i) {
      tem += s[i];
      tem += '#';
    }
    int mx = 0, id = 0, l = tem.size();
    r[l] = 0;
    tem[l] = 0;
    for (int i = 0; i < l; i++) {
      r[i] = mx > i ? min(r[2 * id - i], mx - i) : 1;
      while (tem[i + r[i]] == tem[i - r[i]]) r[i]++;
      if (i + r[i] > mx) {
        mx = i + r[i];
        id = i;
      }
    }
  }
} Ma;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    int l = 0, r = s.size() - 1;
    int pre = 0, suf = 0;
    while (l < r) {
      if (s[l] == s[r]) {
        ++l;
        --r;
      } else
        break;
    }
    string tem = "";
    for (long long i = l; i <= (long long)r; ++i) tem += s[i];
    Ma.build(tem);
    int n = tem.size();
    for (long long i = 1; i <= (long long)2 * n + 1; ++i) {
      if (i & 1) {
        if (Ma.r[i] == i) pre = i - 1;
      } else if (Ma.r[i] == i)
        pre = (i - 1) / 2 * 2 + 1;
    }
    reverse(tem.begin(), tem.end());
    Ma.build(tem);
    for (long long i = 1; i <= (long long)2 * n + 1; ++i) {
      if (i & 1) {
        if (Ma.r[i] == i) suf = i - 1;
      } else if (Ma.r[i] == i)
        suf = (i - 1) / 2 * 2 + 1;
    }
    for (long long i = 0; i <= (long long)l - 1; ++i) cout << s[i];
    if (pre > suf) {
      reverse(tem.begin(), tem.end());
      for (long long i = 0; i <= (long long)pre - 1; ++i) cout << tem[i];
    } else {
      for (long long i = 0; i <= (long long)suf - 1; ++i) cout << tem[i];
    }
    for (long long i = l - 1; i >= (long long)0; --i) cout << s[i];
    cout << "\n";
  }
}
