#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
string get_lps(string s) {
  string rs = s;
  reverse(rs.begin(), rs.end());
  s = s + '#' + rs;
  int n = s.length();
  vector<int> lps(n, 0);
  for (int i = 1; i < n; i++) {
    int prev_ix = lps[i - 1];
    while (prev_ix > 0 && s[i] != s[prev_ix]) {
      prev_ix = lps[prev_ix - 1];
    }
    lps[i] = prev_ix + (s[i] == s[prev_ix] ? 1 : 0);
  }
  int l = lps[n - 1];
  string res = s.substr(0, l);
  return res;
}
void solve() {
  string s;
  cin >> s;
  int n = s.length();
  int i = 0, j = n - 1;
  while (i < j && s[i] == s[j]) {
    i++;
    j--;
  }
  string remain_s = s.substr(i, j - i + 1);
  string rv_remain_s(remain_s);
  reverse(rv_remain_s.begin(), rv_remain_s.end());
  string s1 = get_lps(remain_s);
  string s2 = get_lps(rv_remain_s);
  if (s1.length() < s2.length()) s1 = s2;
  for (int t = 0; t < i; t++) cout << s[t];
  cout << s1;
  for (int t = j + 1; t < n; t++) cout << s[t];
  cout << endl;
}
int main() {
  int test;
  cin >> test;
  while (test--) solve();
  return 0;
}
