#include <bits/stdc++.h>
using namespace std;
vector<long long int> manachar(string second) {
  string q = "@";
  for (long long int i = 0; i < second.size(); i++) {
    q += "#" + second.substr(i, 1);
  }
  q += "#$";
  vector<long long int> P(q.size(), 0);
  long long int c = 0, r = 0;
  for (long long int i = 1; i < q.size() - 1; i++) {
    long long int iMirror = c - (i - c);
    if (r > i) {
      P[i] = min(r - i, P[iMirror]);
    }
    while (q[i + 1 + P[i]] == q[i - 1 - P[i]]) {
      P[i]++;
    }
    if (i + P[i] > r) {
      c = i;
      r = i + P[i];
    }
  }
  return P;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int t;
  cin >> t;
  while (t--) {
    string s, s1 = "", s2 = "", s3 = "", s4 = "", ans1 = "", ans2 = "";
    cin >> s;
    long long int n = s.size();
    long long int i = 0, j = n - 1;
    while (i < j) {
      if (s[i] == s[j]) {
        i++;
        j--;
      } else {
        break;
      }
    }
    s1 = s.substr(0, i);
    s2 = s.substr(j + 1);
    if (n == 1) s2 = "";
    for (long long int k = i; k <= j; k++) s3 += s[k];
    auto vec = manachar(s3);
    for (long long int it = vec.size() - 1; it >= 1; it--) {
      if (it == vec[it] + 1) {
        ans1 = s3.substr(0, vec[it]);
        break;
      }
    }
    s4 = s3;
    reverse(s4.begin(), s4.end());
    auto arr = manachar(s4);
    for (long long int it = arr.size() - 1; it >= 1; it--) {
      if (it == arr[it] + 1) {
        ans2 = s4.substr(0, arr[it]);
        break;
      }
    }
    if (ans1.size() > ans2.size()) {
      cout << s1 + ans1 + s2 << "\n";
    } else {
      cout << s1 + ans2 + s2 << "\n";
    }
  }
  return 0;
}
