#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
vector<int> findperm(vector<int> v) {
  vector<int> w1;
  vector<int> w2;
  vector<int> w;
  sort(v.begin(), v.end());
  if ((v.size() == 2) && (v[1] == (v[0] + 1))) {
    return w;
  }
  if ((v.size() == 3) && (v[2] == (v[0] + 2))) {
    return w;
  }
  int i;
  for (i = 0; i < v.size(); i++) {
    if (v[i] % 2) {
      w1.push_back(v[i]);
    }
  }
  for (i = 0; i < v.size(); i++) {
    if (!(v[i] % 2)) {
      w2.push_back(v[i]);
    }
  }
  if ((w1.size() > 0) && (w2.size() > 0) &&
      (abs(w1[w1.size() - 1] - w2[0]) == 1)) {
    for (i = w1.size() - 1; i >= 0; i--) {
      w.push_back(w1[i]);
    }
    for (i = w2.size() - 1; i >= 0; i--) {
      w.push_back(w2[i]);
    }
  } else {
    for (i = 0; i < w1.size(); i++) {
      w.push_back(w1[i]);
    }
    for (i = 0; i < w2.size(); i++) {
      w.push_back(w2[i]);
    }
  }
  return w;
}
int main() {
  int T;
  cin >> T;
  while (T--) {
    string s;
    int i, j, k;
    int counter[26];
    for (i = 0; i < 26; i++) counter[i] = 0;
    cin >> s;
    vector<int> usedletters;
    for (i = 0; i < s.length(); i++) {
      if (counter[s[i] - 'a'] == 0) {
        usedletters.push_back(s[i] - 'a');
      }
      counter[s[i] - 'a']++;
    }
    string newstring = "";
    vector<int> w = findperm(usedletters);
    if (w.size() == 0) {
      cout << "No answer" << endl;
    } else {
      for (i = 0; i < w.size(); i++) {
        for (j = 0; j < counter[w[i]]; j++) {
          newstring += (w[i] + 'a');
        }
      }
      cout << newstring << endl;
    }
  }
}
