#include <bits/stdc++.h>
using namespace std;
bool vis[1001];
int main() {
  char tmp;
  string s, s1;
  int queries, n;
  cin >> queries;
  while (queries--) {
    s1 = "";
    cin >> s;
    sort(s.begin(), s.end());
    tmp = s[0] - 1;
    n = s.length();
    memset(vis, false, sizeof(vis));
    if (s[0] == s[n - 1]) {
      cout << s << endl;
    } else {
      for (int i = 0; i < n; i++) {
        if (abs(s[i] - tmp) != 1) {
          tmp = s[i];
          s1 = s1 + s[i];
          vis[i] = true;
        }
      }
      for (int i = 0; i < n; i++) {
        if (abs(s[i] - tmp) != 1 && !vis[i]) {
          tmp = s[i];
          s1 = s1 + s[i];
          vis[i] = true;
        }
      }
      for (int i = 0; i < n; i++) {
        if (abs(s[i] - tmp) != 1 && !vis[i]) {
          tmp = s[i];
          s1 = s1 + s[i];
          vis[i] = true;
        }
      }
      for (int i = 0; i < n; i++) {
        if (abs(s[i] - tmp) != 1 && !vis[i]) {
          tmp = s[i];
          s1 = s1 + s[i];
          vis[i] = true;
        }
      }
      if (s1.length() == n)
        cout << s1 << endl;
      else
        cout << "No answer" << endl;
    }
  }
}
