#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
string s;
int cnt[30];
void init() {}
void input() {
  cin >> s;
  for (int i = 0; i < 26; i++) {
    cnt[i] = 0;
  }
  for (auto c : s) {
    cnt[int(c) - int('a')]++;
  }
}
void solve() {
  int eve[2] = {27, -1};
  for (int i = 0; i < 26; i += 2) {
    if (cnt[i]) {
      eve[0] = min(eve[0], i);
      eve[1] = max(eve[1], i);
    }
  }
  int odd[2] = {27, -1};
  for (int i = 1; i < 26; i += 2) {
    if (cnt[i]) {
      odd[0] = min(odd[0], i);
      odd[1] = max(odd[1], i);
    }
  }
  if (eve[0] == 27 || odd[0] == 27) {
    for (int i = 0; i < 26; i += 2) {
      for (int j = 0; j < cnt[i]; j++) {
        cout << char(i + int('a'));
      }
    }
    for (int i = 1; i < 26; i += 2) {
      for (int j = 0; j < cnt[i]; j++) {
        cout << char(i + int('a'));
      }
    }
  } else if (abs(eve[1] - odd[0]) != 1) {
    for (int i = 0; i < 26; i += 2) {
      for (int j = 0; j < cnt[i]; j++) {
        cout << char(i + int('a'));
      }
    }
    for (int i = 1; i < 26; i += 2) {
      for (int j = 0; j < cnt[i]; j++) {
        cout << char(i + int('a'));
      }
    }
  } else if (abs(eve[0] - odd[1]) != 1) {
    for (int i = 24; i > -1; i -= 2) {
      for (int j = 0; j < cnt[i]; j++) {
        cout << char(i + int('a'));
      }
    }
    for (int i = 25; i > -1; i -= 2) {
      for (int j = 0; j < cnt[i]; j++) {
        cout << char(i + int('a'));
      }
    }
  } else {
    cout << "No answer";
  }
  cout << endl;
}
void output() {}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int number_of_testcases = 1;
  cin >> number_of_testcases;
  while (number_of_testcases--) {
    init();
    input();
    solve();
    output();
  }
  return 0;
}
