#include <bits/stdc++.h>
using namespace std;
int t, buck[300], buck2[300];
string pal;
char x;
int main() {
  scanf("%d", &t);
  for (int i = 0; i < t; i++) {
    cin >> pal;
    for (int j = 0; j < pal.size(); j++) {
      buck[pal[j]]++;
    }
    pal = "";
    for (int j = 'a'; j <= 'z'; j++) {
      if (buck[j] > 0) {
        pal += j;
        buck2[j] = buck[j];
        buck[j] = 0;
      }
    }
    int n = pal.size();
    string nueva = "", nueva2 = "";
    bool b1 = true, b2 = true;
    for (int j = 0, x = (n + 1) / 2, x1 = (n + 1) / 2, pos = -1, pos2 = -1;
         j < n or x < n; j++, x++) {
      if (j < x1) {
        nueva += pal[j];
        pos++;
        if (pos > 0) {
          if (abs(nueva[pos] - nueva[pos - 1]) == 1) b1 = false;
        }
      }
      if (x < n) {
        nueva += pal[x];
        nueva2 += pal[x];
        pos++;
        pos2++;
        if (pos > 0) {
          if (abs(nueva[pos] - nueva[pos - 1]) == 1) b1 = false;
        }
        if (pos2 > 0) {
          if (abs(nueva2[pos2] - nueva2[pos2 - 1]) == 1) b2 = false;
        }
      }
      if (j < x1) {
        nueva2 += pal[j];
        pos2++;
        if (pos2 > 0) {
          if (abs(nueva2[pos2] - nueva2[pos2 - 1]) == 1) b2 = false;
        }
      }
    }
    if (b1 == true) {
      for (int j = 0; j < n; j++) {
        while (buck2[nueva[j]] > 0) {
          printf("%c", nueva[j]);
          buck2[nueva[j]]--;
        }
      }
    } else if (b2 == true) {
      for (int j = 0; j < n; j++) {
        while (buck2[nueva2[j]] > 0) {
          printf("%c", nueva2[j]);
          buck2[nueva2[j]]--;
        }
      }
    } else
      printf("No answer");
    printf("\n");
  }
  return 0;
}
