#include <bits/stdc++.h>
using namespace std;
void solve() {
  string s;
  cin >> s;
  vector<long long> cnt(26, 0);
  for (auto x : s) {
    cnt[x - 'a']++;
  }
  deque<long long> d;
  for (long long i = 0; i < 26; i++) {
    if (cnt[i]) {
      d.push_back(i);
    }
  }
  deque<long long> ans;
  if ((long long)d.size() == 2) {
    if (d[0] + 1 == d[1]) {
      cout << "No answer" << '\n';
      return;
    }
    ans = d;
  } else if ((long long)d.size() == 3) {
    if (d[0] + 1 == d[1] && d[1] + 1 == d[2]) {
      cout << "No answer" << '\n';
      return;
    } else if (d[0] + 1 == d[1]) {
      ans.push_back(d[0]);
      ans.push_back(d[2]);
      ans.push_back(d[1]);
    } else {
      ans.push_back(d[1]);
      ans.push_back(d[0]);
      ans.push_back(d[2]);
    }
  } else {
    long long fl = 1;
    while ((long long)d.size() > 1) {
      if (fl) {
        ans.push_back(d.front());
        d.pop_front();
      } else {
        ans.push_back(d.back());
        d.pop_back();
      }
      fl ^= 1;
    }
    ans.push_front(d[0]);
  }
  for (auto x : ans) {
    for (long long i = 0; i < cnt[x]; i++) {
      cout << (char)(x + 'a');
    }
  }
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tc;
  tc = 1;
  cin >> tc;
  for (int i = 1; i <= tc; i++) {
    solve();
  }
  return 0;
}
