#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<vector<int> > vk(n), v(n), vi(n);
  for (int i = 0; i < n; i++) {
    int s = 0, u = 0;
    string S;
    cin >> S;
    for (int j = 0; j < 26; j++) {
      vk[i].push_back(0);
    }
    for (int j = 0; j < S.length(); j++) {
      vk[i][S[j] - 'a']++;
      s++;
    }
    int t = 0;
    for (int j = 0; j < 26; j++) {
      if (vk[i][j] != 0) t++;
    }
    if (t == 3) {
      for (int j = 1; j < 25; j++)
        if (vk[i][j - 1] * vk[i][j] * vk[i][j + 1] != 0) {
          cout << "No answer";
          u = 1;
        }
    }
    if (t == 2) {
      for (int j = 1; j < 26; j++)
        if (vk[i][j - 1] * vk[i][j] != 0) {
          cout << "No answer";
          u = 1;
        }
    }
    if (u == 0) {
      for (int j = 0; j < 26; j++)
        if (vk[i][j] > 0) v[i].push_back(j);
      for (int j = 0; j < v[i].size(); j++) {
        if (j < v[i].size() - 1 && v[i][j + 1] - v[i][j] == 1) {
          vi[i].push_back(v[i][j + 1]);
          j++;
        } else if (j > 0 && v[i][j] - v[i][j - 1] != 1)
          vi[i].push_back(v[i][j]);
      }
      for (int j = 0; j < v[i].size(); j++) {
        int d = 0;
        for (int k = 0; k < vi[i].size(); k++) {
          if (v[i][j] == vi[i][k]) d = 1;
        }
        if (d == 0) vi[i].push_back(v[i][j]);
      }
      for (int j = 0; j < vi[i].size(); j++) {
        for (int k = 0; k < vk[i][vi[i][j]]; k++) {
          char c;
          c = vi[i][j] + 'a';
          cout << c;
        }
      }
    }
    cout << endl;
  }
}
