#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e5 + 5;
const long long oo = 1e15;
const long long MOD = 1e9 + 7;
const int base = 311;
long long TestCase;
string s, st, ss;
void Solve() {
  cin >> s;
  st = ss = "";
  for (long long i = (long long)0; i <= (long long)s.size() - 1; i++) {
    if (s[i] % 2 == 0)
      st += s[i];
    else
      ss += s[i];
  }
  sort(ss.begin(), ss.end());
  sort(st.begin(), st.end());
  if (abs(ss[ss.size() - 1] - st[0]) > 1) {
    cout << ss << st << "\n";
    return;
  } else if (abs(ss[0] - st[st.size() - 1]) > 1) {
    cout << st << ss << "\n";
    return;
  } else
    cout << "No answer\n";
}
int main() {
  ios_base::sync_with_stdio(NULL);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> TestCase;
  while (TestCase--) Solve();
  return 0;
}
