#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
char s[109];
int a[29];
char r[109];
struct Node {
  int id;
  int ci;
} b[29];
int vis[29];
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    memset(a, 0, sizeof(a));
    memset(r, 0, sizeof(r));
    memset(vis, 0, sizeof(vis));
    scanf("%s", s);
    int n = strlen(s);
    for (int i = 0; i < n; ++i) ++a[s[i] - 'a'];
    int m = 0;
    int len = 0;
    for (int i = 0; i < 26; ++i)
      if (a[i]) {
        b[m].id = i;
        b[m].ci = a[i];
        ++m;
      }
    if (m == 1) {
      for (int i = b[m - 1].ci; i >= 1; --i) printf("%c", 'a' + b[m - 1].id);
      printf("\n");
      continue;
    }
    for (int i = b[m - 2].ci; i >= 1; --i) r[len++] = 'a' + b[m - 2].id;
    int last = b[m - 2].id;
    vis[m - 2] = 1;
    for (int i = m - 3; i >= 0; --i)
      if ((last - b[i].id) != 1) {
        last = b[i].id;
        for (int j = 0; j < b[i].ci; ++j) r[len++] = 'a' + b[i].id;
        vis[i] = 1;
      }
    for (int i = m - 1; i >= 0; --i)
      if (!vis[i])
        for (int j = 0; j < b[i].ci; ++j) r[len++] = 'a' + b[i].id;
    int f = 1;
    for (int i = 1; i < len; ++i)
      if (abs(r[i] - r[i - 1]) == 1) f = 0;
    printf("%s\n", (f ? r : "No answer"));
  }
  return 0;
}
