#include <bits/stdc++.h>
using namespace std;
int pal(string second) {
  string temp = second;
  reverse(second.begin(), second.end());
  return (temp == second);
}
string max_pal(string second) {
  string ans = "";
  for (int i = 1; i <= second.length(); ++i) {
    string tel = second.substr(0, i);
    if (pal(tel)) ans = tel;
  }
  return ans;
}
string manacher(string second) {
  string ans = "";
  int n = second.length(), maxlen = 0, l, r;
  vector<int> d1(n);
  for (int i = 0, l = 0, r = -1; i < n; i++) {
    int k = (i > r) ? 1 : min(d1[l + r - i], r - i + 1);
    while (0 <= i - k && i + k < n && second[i - k] == second[i + k]) {
      k++;
    }
    d1[i] = k--;
    if (i + k > r) {
      l = i - k;
      r = i + k;
    }
  }
  for (int i = 0; i < n; ++i) {
    if ((d1[i] - i) == 1 && i + d1[i] > maxlen) {
      l = 0;
      r = i + d1[i];
      maxlen = i + d1[i];
    }
    if ((d1[i] + i) == n && 2 * d1[i] - 1 > maxlen) {
      l = i - d1[i] + 1;
      r = n;
      maxlen = 2 * d1[i] - 1;
    }
  }
  vector<int> d2(n);
  for (int i = 0, l = 0, r = -1; i < n; i++) {
    int k = (i > r) ? 0 : min(d2[l + r - i + 1], r - i + 1);
    while (0 <= i - k - 1 && i + k < n && second[i - k - 1] == second[i + k]) {
      k++;
    }
    d2[i] = k--;
    if (i + k > r) {
      l = i - k - 1;
      r = i + k;
    }
  }
  for (int i = 0; i < n; ++i) {
    if ((d2[i] - i) == 0 && i + d2[i] > maxlen) {
      l = 0;
      r = i + d2[i];
      maxlen = i + d2[i];
    }
    if ((d2[i] + i) == n && 2 * d2[i] > maxlen) {
      l = i - d2[i];
      r = n;
      maxlen = 2 * d2[i];
    }
  }
  ans = second.substr(l, r);
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  cin >> t;
  while (t--) {
    string second;
    cin >> second;
    int n = second.length();
    int i = 0, j = n - 1;
    while (i < j && second[i] == second[j]) {
      i++;
      j--;
    }
    string ans = second.substr(0, i);
    string x = second.substr(i, n - 2 * i);
    if (x.empty()) {
      cout << second << '\n';
    } else {
      string front = manacher(x);
      reverse(x.begin(), x.end());
      string back = manacher(x);
      reverse(back.begin(), back.end());
      if (front.size() > back.size()) {
        cout << ans << front;
        reverse(ans.begin(), ans.end());
        cout << ans << '\n';
      } else {
        cout << ans << back;
        reverse(ans.begin(), ans.end());
        cout << ans << '\n';
      }
    }
  }
  return 0;
}
