#include <bits/stdc++.h>
using namespace std;
long long lpp(const string &s) {
  string kmprev = s;
  std::reverse(kmprev.begin(), kmprev.end());
  string kmp = s + "#" + kmprev;
  vector<long long> lps(kmp.size(), 0);
  for (long long i = 1; i < (long long)lps.size(); ++i) {
    long long prev_idx = lps[i - 1];
    while (prev_idx > 0 && kmp[i] != kmp[prev_idx]) {
      prev_idx = lps[prev_idx - 1];
    }
    lps[i] = prev_idx + (kmp[i] == kmp[prev_idx] ? 1 : 0);
  }
  return lps[lps.size() - 1];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    long long cnt = 0;
    long long sz = s.size();
    for (long long i = 0; i < sz / 2; i++) {
      if (s[i] == s[sz - i - 1])
        cnt++;
      else
        break;
    }
    if (cnt == sz / 2)
      cout << s << "\n";
    else {
      string t1 = s.substr(cnt, sz - (2 * cnt));
      string t2 = t1;
      reverse(t2.begin(), t2.end());
      long long a = lpp(t1);
      long long b = lpp(t2);
      string fin = s.substr(0, cnt);
      string res = fin;
      reverse(res.begin(), res.end());
      if (a >= b) {
        fin += t1.substr(0, a);
        fin += res;
        cout << fin << "\n";
      } else {
        fin += t2.substr(0, b);
        fin += res;
        cout << fin << "\n";
      }
    }
  }
}
