#include <bits/stdc++.h>
const int MOD = 998244353;
const int maxn = 105;
using namespace std;
char ma[maxn];
int num[30];
int main() {
  int n;
  scanf("%d", &n);
  while (n--) {
    memset(num, 0, sizeof(num));
    string s1 = "", s2 = "";
    scanf("%s", ma + 1);
    int len = strlen(ma + 1);
    for (int i = 1; i <= len; i++) {
      num[ma[i] - 'a']++;
    }
    int ans = 1;
    for (int i = 0; i < 26; i++) {
      if (num[i] == 0) {
        continue;
      }
      if (ans & 1) {
        while (num[i]--) {
          s1 += ('a' + i);
        }
        ans++;
      } else {
        while (num[i]--) {
          s2 += ('a' + i);
        }
        ans++;
      }
    }
    if (abs(s1[s1.size() - 1] - s2[0]) != 1) {
      cout << s1 << s2 << endl;
    } else if (abs(s2[s2.size() - 1] - s1[0]) != 1) {
      cout << s2 << s1 << endl;
    } else {
      cout << "No answer" << endl;
    }
  }
  return 0;
}
