#include <bits/stdc++.h>
using namespace std;
unsigned long long modulo(long long a, long long b, long long n) {
  long long x = 1, y = a;
  while (b > 0) {
    if (b % 2 == 1) {
      x = (x * y) % n;
    }
    y = (y * y) % n;
    b /= 2;
  }
  return x % n;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  gcd(b, a % b);
}
void printVec(vector<int> v, int n) {
  for (int i = 0; i < n; i++) cout << v[i] + 1 << " ";
  cout << endl;
}
long long nc2(int n) { return n * (n - 1) / 2; }
bool check(string s) {
  bool ok = true;
  for (int i = 0; i < int(int(s.size()) - 1); i++)
    ok &= (abs(s[i] - s[i + 1]) != 1);
  return ok;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  srand(time(NULL));
  ;
  int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    string odd = "";
    string even = "";
    for (int i = 0; i < s.length(); i++) {
      if (s[i] % 2)
        odd += s[i];
      else
        even += s[i];
    }
    sort(odd.begin(), odd.end());
    sort(even.begin(), even.end());
    if (check(odd + even))
      cout << odd + even << endl;
    else if (check(even + odd))
      cout << even + odd << endl;
    else
      cout << "No answer" << endl;
  }
  return 0;
}
