#include <bits/stdc++.h>
using namespace std;
int T, cnt[112];
string s;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> T;
  while (T--) {
    cin >> s;
    memset(cnt, 0, sizeof(cnt));
    for (int i = 0; i < (int)s.size(); ++i) {
      ++cnt[s[i] - 'a'];
    }
    vector<pair<int, int> > a;
    for (int i = (int)0; i <= (int)25; ++i) {
      if (cnt[i]) a.push_back(pair<int, int>(i + 'a', cnt[i]));
    }
    string res;
    for (int i = 1; i < (int)a.size(); i += 2) {
      for (int j = (int)1; j <= (int)a[i].second; ++j) res += char(a[i].first);
    }
    for (int i = 0; i < (int)a.size(); i += 2) {
      for (int j = (int)1; j <= (int)a[i].second; ++j) res += char(a[i].first);
    }
    bool check = true;
    for (int i = (int)1; i <= (int)res.size() - 1; ++i) {
      if (abs(res[i] - res[i - 1]) == 1) {
        check = false;
      }
    }
    if (check)
      cout << res << '\n';
    else {
      string tu;
      for (int i = 0; i < (int)a.size(); i += 2) {
        for (int j = (int)1; j <= (int)a[i].second; ++j) tu += char(a[i].first);
      }
      bool ok = true;
      for (int i = 1; i < (int)a.size(); i += 2) {
        for (int j = (int)1; j <= (int)a[i].second; ++j) tu += char(a[i].first);
      }
      for (int i = (int)1; i <= (int)tu.size() - 1; ++i) {
        ok = ok && (abs(tu[i] - tu[i - 1]) != 1);
      }
      if (ok)
        cout << tu << '\n';
      else
        cout << "No answer\n";
    }
  }
}
