#include <bits/stdc++.h>
using namespace std;
const long long BINF = 9e18, LINF = 2e9, mod = 998244353, P = 179,
                Q = 1791791791;
const long long MAXN = 3e5 + 7;
map<char, long long> m;
bool check(string ans) {
  bool ok = 1;
  for (long long i = 1; i < ans.size(); ++i)
    if (abs(ans[i] - ans[i - 1]) == 1) ok = 0;
  return ok;
}
void solve() {
  string s;
  cin >> s;
  m.clear();
  for (char first : s) m[first]++;
  vector<pair<char, long long>> v;
  for (pair<char, long long> pr : m) v.push_back(pr);
  string ans;
  for (long long i = 1; i < v.size(); i += 2)
    for (long long j = 0; j < v[i].second; ++j) ans += v[i].first;
  for (long long i = 0; i < v.size(); i += 2)
    for (long long j = 0; j < v[i].second; ++j) ans += v[i].first;
  if (check(ans)) {
    cout << ans << endl;
    return;
  }
  ans = "";
  for (long long i = 0; i < v.size(); i += 2)
    for (long long j = 0; j < v[i].second; ++j) ans += v[i].first;
  for (long long i = 1; i < v.size(); i += 2)
    for (long long j = 0; j < v[i].second; ++j) ans += v[i].first;
  if (check(ans))
    cout << ans << endl;
  else
    cout << "No answer\n";
  return;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cout.precision(40);
  long long t;
  cin >> t;
  for (long long i = 0; i < t; ++i) solve();
  return 0;
}
