#include <bits/stdc++.h>
using namespace std;
long long i, j, k, sz, n, m, x, z, ans, a[300005];
int main() {
  cin >> n;
  while (n--) {
    string s, s1, s2;
    cin >> s;
    long long sz = s.size();
    sort(s.begin(), s.end());
    for (i = 0; i < sz; i++) {
      if (s[i] - 'a' & 1)
        s1 += s[i];
      else
        s2 += s[i];
    }
    if (s1.size() == 0) {
      cout << s2 << endl;
    } else if (s2.size() == 0) {
      cout << s1 << endl;
    } else if (abs(s2[0] - s1[s1.size() - 1]) != 1) {
      cout << s1 << s2 << endl;
    } else if (abs(s1[0] - s2[s2.size() - 1]) != 1) {
      cout << s2 << s1 << endl;
    } else {
      cout << "No answer" << endl;
    }
  }
  return 0;
}
