#include <bits/stdc++.h>
using namespace std;
const long long Mod = 7 + 1e9;
const long long INF32 = 5 + 2e9;
const long long INF64 = 1 + 5e3;
const long long MAX = 5 + 3e5;
int N, M;
int main() {
  cin >> M;
  while (M--) {
    string s, ans;
    cin >> s;
    sort(s.begin(), s.end());
    N = s.size();
    char pre = '?';
    int i = 0;
    while (i < N) {
      if (s[i] == '?') {
        i++;
        continue;
      }
      if (abs(pre - s[i]) == 1) {
        int j = upper_bound(s.begin(), s.end(), s[i] + 1) - s.begin();
        if (j == N) {
          string ans2;
          char tmp = s[i];
          for (; i < N && tmp == s[i]; i++) ans2 += s[i], s[i] = '?';
          ans = ans2 + ans;
          continue;
        }
        pre = s[j];
        while (j < N && pre == s[j]) ans += s[j], s[j++] = '?';
      }
      pre = s[i];
      while (i < N && pre == s[i]) ans += s[i], s[i++] = '?';
    }
    bool ok = 1;
    for (int i = 1; i < N; i++)
      if (abs(ans[i] - ans[i - 1]) == 1) ok = 0;
    cout << (ok ? ans : "No answer") << endl;
  }
  return 0;
}
