#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long double PI = 4 * atan((long double)1);
const int MOD = 1000000007;
int cnt[26];
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    memset(cnt, 0, sizeof(cnt));
    string second;
    cin >> second;
    sort(second.begin(), second.end());
    string g;
    for (int i = 0; i < second.length(); i++) cnt[second[i] - 'a']++;
    for (int i = 0; i < 26; i++)
      if (cnt[i]) g += 'a' + i;
    vector<char> eve, odd;
    for (int i = 0; i < g.length(); i++) {
      if (i % 2)
        odd.push_back(g[i]);
      else
        eve.push_back(g[i]);
    }
    string fin;
    for (int i = 0; i < eve.size(); i++)
      for (int j = 0; j < cnt[eve[i] - 'a']; j++) fin += eve[i];
    for (int i = 0; i < odd.size(); i++)
      for (int j = 0; j < cnt[odd[i] - 'a']; j++) fin += odd[i];
    char pre;
    for (int i = 0; i < fin.length(); i++) {
      if (i != 0 && (pre == fin[i] - 1 || pre == fin[i] + 1)) {
        fin = "No answer";
        break;
      }
      pre = fin[i];
    }
    if (fin == "No answer") {
      fin.clear();
      for (int i = 0; i < odd.size(); i++)
        for (int j = 0; j < cnt[odd[i] - 'a']; j++) fin += odd[i];
      for (int i = 0; i < eve.size(); i++)
        for (int j = 0; j < cnt[eve[i] - 'a']; j++) fin += eve[i];
      for (int i = 0; i < fin.length(); i++) {
        if (i != 0 && (pre == fin[i] - 1 || pre == fin[i] + 1)) {
          fin = "No answer";
          break;
        }
        pre = fin[i];
      }
    }
    cout << fin << endl;
  }
  return 0;
}
