#include <bits/stdc++.h>
using namespace std;
char buf[1 << 23], *fc = buf, *tc = buf;
inline char gc() {
  if (fc == tc) {
    tc = (fc = buf) + fread(buf, 1, 1 << 23, stdin);
    if (fc == tc) return EOF;
  }
  return *fc++;
}
inline int read() {
  int x = 0, f = 1;
  char ch;
  while (!isdigit(ch = getchar()))
    if (ch == '-') f = -1;
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  return f * x;
}
const int N = 5e2 + 10;
int T, cnt[30], vis[30];
char s[N];
int a[N], n;
bool dfs(int x) {
  if (x == n + 1) return true;
  for (register int i = 1; i <= 26; ++i) {
    if (!vis[i] && cnt[i] && i != a[x - 1] + 1 && i != a[x - 1] - 1) {
      vis[i] = 1;
      a[x] = i;
      if (dfs(x + 1)) return true;
      vis[i] = 0;
    }
  }
  return false;
}
int main() {
  scanf("%d", &T);
  while (T--) {
    scanf("%s", s);
    memset(vis, 0, sizeof(vis));
    memset(cnt, 0, sizeof(cnt));
    n = 0;
    for (register int i = 0, len = strlen(s); i < len; ++i)
      if (++cnt[s[i] - 'a' + 1] == 1) ++n;
    a[0] = -10;
    if (!dfs(1))
      puts("No answer");
    else {
      for (register int i = 1; i <= n; ++i)
        for (register int j = 1; j <= cnt[a[i]]; ++j) putchar('a' + a[i] - 1);
      putchar('\n');
    }
  }
  return 0;
}
