#include <bits/stdc++.h>
using namespace std;
int Q;
string str;
int used[26];
vector<int> has_idx;
int main() {
  cin >> Q;
  while (Q--) {
    cin >> str;
    memset(used, 0, sizeof(used));
    has_idx.clear();
    for (int i = 0; i < str.size(); i++) {
      if (!used[str[i] - 'a']) has_idx.push_back(str[i] - 'a');
      used[str[i] - 'a']++;
    }
    sort(has_idx.begin(), has_idx.end());
    string ans = "";
    bool ok = 1;
    if (has_idx.size() == 2 && has_idx[1] - has_idx[0] == 1)
      ok = 0;
    else if (has_idx.size() == 3) {
      if (has_idx[1] - has_idx[0] == 1 && has_idx[2] - has_idx[1] == 1)
        ok = 0;
      else if (has_idx[1] - has_idx[0] == 1) {
        swap(has_idx[0], has_idx[2]);
      }
      for (int j = has_idx.size() - 1; j >= 0; j -= 2) {
        for (int k = 1; k <= used[has_idx[j]]; k++) ans += ('a' + has_idx[j]);
      }
      for (int j = has_idx.size() - 2; j >= 0; j -= 2) {
        for (int k = 1; k <= used[has_idx[j]]; k++) ans += ('a' + has_idx[j]);
      }
    } else {
      for (int j = has_idx.size() - 2; j >= 0; j -= 2) {
        for (int k = 1; k <= used[has_idx[j]]; k++) ans += ('a' + has_idx[j]);
      }
      for (int j = has_idx.size() - 1; j >= 0; j -= 2) {
        for (int k = 1; k <= used[has_idx[j]]; k++) ans += ('a' + has_idx[j]);
      }
    }
    cout << (ok ? ans : "No answer") << "\n";
  }
  return 0;
}
