#include <bits/stdc++.h>
using namespace std;
vector<long long> sieve;
void Sieve(int N) {
  const long long maxn = N;
  sieve.resize(maxn);
  for (long long(i) = 0; (i) < (maxn); ++(i)) sieve[i] = i;
  sieve[1] = -1;
  sieve[0] = -1;
  for (long long(i) = 2; (i) <= (maxn); (i) += (1))
    if (i == sieve[i])
      for (long long j = 2 * i; j < maxn; j += i)
        if (sieve[j] == j) sieve[j] = i;
}
long long extended_GCD(long long a, long long b, long long &x, long long &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = extended_GCD(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return gcd;
}
long long power(long long a, long long b, long long m = 1000000007) {
  a %= m;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
    b >>= 1;
  }
  return res;
}
long long modinv(long long a, long long mod = 1000000007) {
  long long x, y;
  extended_GCD(a, mod, x, y);
  if (x < 0) x += mod;
  return x;
}
bool fun(string s) {
  for (int i = 0; i < s.length() - 1; ++i) {
    if (abs(s[i] - s[i + 1]) == 1) return false;
  }
  return true;
}
void solve() {
  long long n;
  string s;
  cin >> s;
  long long a[26] = {0};
  n = s.length();
  for (int i = 0; i < n; ++i) {
    a[s[i] - 'a']++;
  }
  string s1 = "", s2 = "";
  for (int i = 1; i < 26; i += 2) {
    for (int j = 0; j < a[i]; ++j) {
      s1 += char('a' + i);
    }
  }
  for (int i = 0; i < 26; i += 2) {
    for (int j = 0; j < a[i]; ++j) {
      s2 += char('a' + i);
    }
  }
  sort(s1.begin(), s1.end());
  sort(s2.begin(), s2.end());
  if (fun(s1 + s2)) {
    cout << s1 + s2;
  } else if (fun(s2 + s1)) {
    cout << s2 + s1;
  } else
    cout << "No answer";
  cout << "\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
