#include <bits/stdc++.h>
using namespace std;
template <class T>
void __f(const char* name, T&& a) {
  cerr << name << ": " << a << '\n';
}
template <class T, class... Ts>
void __f(const char* names, T&& a, Ts&&... b) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << a << " /";
  __f(comma + 1, b...);
}
template <class T>
bool mini(T& a, const T& b) {
  return a > b ? (a = b, 1) : 0;
}
template <class T>
bool maxi(T& a, const T& b) {
  return a < b ? (a = b, 1) : 0;
}
const int inf = (int)0x3f3f3f3f3f3f3f3f;
const int ninf = (int)0xc0c0c0c0c0c0c0c0;
const long long M = (long long)1e9 + 7;
int f(const string& s) {
  vector<int> kmp((int)((s).size()));
  for (int i = (1), _b = ((int)((s).size())); i < _b; ++i) {
    int j = kmp[i - 1];
    while (j > 0 && s[i] != s[j]) j = kmp[j - 1];
    if (s[i] == s[j]) ++j;
    kmp[i] = j;
  }
  return kmp[(int)((s).size()) - 1];
}
void solve() {
  string a;
  cin >> a;
  int n = (int)((a).size());
  string b((a).begin(), (a).end());
  reverse((b).begin(), (b).end());
  string s;
  int tmp;
  pair<int, pair<int, int> > ans;
  s = a + '#' + b;
  tmp = f(s);
  maxi(ans, {tmp, {tmp - 1, n + 1}});
  s = b + '#' + a;
  tmp = f(s);
  maxi(ans, {tmp, {-1, n - tmp}});
  int pos = -1;
  for (int i = (0), _b = (n); i < _b; ++i)
    if (a[i] != a[n - i - 1]) {
      pos = i;
      break;
    }
  if (~pos) {
    string x = a.substr(pos, n - 2 * pos);
    string y((x).begin(), (x).end());
    reverse((y).begin(), (y).end());
    s = x + '#' + y;
    tmp = f(s);
    maxi(ans, {2 * pos + tmp, {pos + tmp - 1, n - pos}});
    s = y + '#' + x;
    tmp = f(s);
    maxi(ans, {2 * pos + tmp, {pos - 1, n - pos - tmp}});
  }
  for (int i = (0), _b = (ans.second.first); i <= _b; ++i) cout << a[i];
  for (int i = (ans.second.second), _b = (n); i < _b; ++i) cout << a[i];
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
}
