#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using llu = long long unsigned;
using ld = long double;
const ld EPS = 1e-9;
inline int cmp(ld first, ld second = 0, ld tol = EPS) {
  return (first <= second + tol) ? (first + tol < second) ? -1 : 0 : 1;
}
const int MOD = 1;
inline int mod(ll first, int m = MOD) { return (int)(((first % m) + m) % m); }
int n;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  while (n--) {
    string s;
    cin >> s;
    sort(s.begin(), s.end(), [&](char a, char b) {
      if (a % 2 != b % 2) return a % 2 == 1;
      return a < b;
    });
    int p = 0;
    while (p < ((int)(s).size()) and s[p] % 2 == 1) ++p;
    if (p == ((int)(s).size()) or p == 0)
      cout << s << '\n';
    else {
      int s1 = p;
      int s2 = ((int)(s).size()) - s1;
      bool ok = false;
      for (int i = 0; !ok and i < s1; i++) {
        for (int j = 0; !ok and j < s2; j++) {
          if (abs(s[p] - s[p - 1]) != 1) {
            ok = true;
            break;
          }
          rotate(s.begin() + s1, s.begin() + s1 + 1, s.end());
        }
        if (!ok) rotate(s.begin(), s.begin() + 1, s.begin() + s1);
      }
      if (ok)
        cout << s << '\n';
      else
        cout << "No answer\n";
    }
  }
  return 0;
}
