#include <bits/stdc++.h>
using namespace std;
int xx[4] = {1, -1, 0, 0};
int yy[4] = {0, 0, 1, -1};
const double eps = 1e-9;
const int maxn = 2e6 + 5000;
const long long mod = 1e9 + 7;
const int INF(0x3f3f3f3f);
const long long INFL(0x3f3f3f3f3f3f3f3fll);
inline int sign(double a) { return a < -eps ? -1 : a > eps; }
long long mul(long long a, long long b, long long c) {
  long long res = 1;
  while (b) {
    if (b & 1) res *= a, res %= c;
    a *= a, a %= c, b >>= 1;
  }
  return res;
}
long long phi(long long x) {
  long long res = x;
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) res = res / i * (i - 1);
    while (x % i == 0) x /= i;
  }
  if (x > 1) res = res / x * (x - 1);
  return res;
}
template <typename A, typename B>
inline bool chmin(A& a, B b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename A, typename B>
inline bool chmax(A& a, B b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename A, typename B>
inline long long add(A x, B y) {
  if (x + y < 0) return x + y + mod;
  return x + y >= mod ? x + y - mod : x + y;
}
template <typename A, typename B>
inline void add2(A& x, B y) {
  if (x + y < 0)
    x = x + y + mod;
  else
    x = (x + y >= mod ? x + y - mod : x + y);
}
template <typename A, typename B>
inline long long mul1(A x, B y) {
  return 1ll * x * y % mod;
}
template <typename A, typename B>
inline void mul2(A& x, B y) {
  x = (1ll * x * y % mod + mod) % mod;
}
template <typename A>
inline void debug(A a) {
  cout << a << '\n';
}
template <typename A>
inline long long sqr(A x) {
  return 1ll * x * x;
}
template <typename A>
A inv(A x) {
  return mul(x, mod - 2);
}
template <class T>
void wt(const T& x) {
  cout << x << endl;
}
template <class T>
void wt(const T& x, char c) {
  cout << x << c;
}
template <class T>
void wt(const T& x, const string& s) {
  cout << x << s;
}
template <class T>
void wt(const T& x, int rnd) {
  cout << fixed << setprecision(rnd) << x << endl;
}
inline void debug() { cout << "###!!!" << endl; }
inline long long read() {
  char c = getchar();
  long long x = 0, f = 1;
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = 1ll * x * 10 + c - '0', c = getchar();
  return x * f;
}
int fa[maxn];
int Find(int x) {
  if (x != fa[x]) return fa[x] = Find(fa[x]);
  return fa[x];
}
long long n, k;
int a[maxn];
map<char, int> m;
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  while (n--) {
    m.clear();
    string str;
    cin >> str;
    vector<char> v1, v2;
    for (int i = 0; i < str.size(); i++) {
      if (str[i] % 2 == 0)
        v1.push_back(str[i]);
      else
        v2.push_back(str[i]);
    }
    if (!v1.size()) {
      for (auto d : v2) cout << d;
      cout << endl;
      continue;
    }
    if (!v2.size()) {
      for (auto d : v1) cout << d;
      cout << endl;
      continue;
    }
    int id1 = -1, id2 = -1;
    for (int i = 0; i < v1.size(); i++) {
      for (int j = 0; j < v2.size(); j++) {
        if (abs(v1[i] - v2[j]) != 1) {
          id1 = i, id2 = j;
          goto kk;
        }
      }
    }
  kk:;
    if (id1 == -1) {
      cout << "No answer" << endl;
      continue;
    }
    for (int i = 0; i < v1.size(); i++) {
      if (i != id1) cout << v1[i];
    }
    cout << v1[id1] << v2[id2];
    for (int i = 0; i < v2.size(); i++) {
      if (i != id2) cout << v2[i];
    }
    cout << endl;
  }
  return 0;
}
