#include <bits/stdc++.h>
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 998244353LL;
using namespace std;
bool check(string& s) {
  bool flag = true;
  for (long long i = 1; i < s.size(); i++) {
    long long tmp1 = s[i] - 'a';
    long long tmp2 = s[i - 1] - 'a';
    if (tmp1 + 1 == tmp2 || tmp1 - 1 == tmp2) {
      flag = false;
      break;
    }
  }
  return flag;
}
vector<pair<char, long long>> RLE(string& s) {
  long long cnt = 0;
  vector<pair<char, long long>> res;
  for (long long i = 0; i < s.size(); i++) {
    cnt++;
    if (i == (long long)s.size() - 1) {
      res.push_back(make_pair(s[i], cnt));
      break;
    }
    if (s[i] != s[i + 1]) {
      res.push_back(make_pair(s[i], cnt));
      cnt = 0;
    }
  }
  return res;
}
int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  long long t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    sort(s.begin(), s.end());
    vector<pair<char, long long>> vp = RLE(s);
    long long N = vp.size();
    if (N == 1) {
      cout << s << "\n";
      continue;
    }
    if (N == 2) {
      if (vp[0].first - 'a' + 1 == vp[1].first - 'a') {
        cout << "No answer"
             << "\n";
      } else {
        for (auto p : vp) {
          for (long long i = 0; i < p.second; i++) {
            cout << p.first;
          }
        }
        cout << "\n";
      }
      continue;
    }
    vector<pair<char, long long>> odd, even;
    for (auto p : vp) {
      long long tmp = p.first - 'a';
      if (tmp & 1)
        odd.push_back(p);
      else
        even.push_back(p);
    }
    string res1, res2;
    for (auto p : odd) {
      for (long long i = 0; i < p.second; i++) {
        res1 += p.first;
      }
    }
    for (auto p : even) {
      for (long long i = 0; i < p.second; i++) {
        res1 += p.first;
      }
    }
    for (auto p : even) {
      for (long long i = 0; i < p.second; i++) {
        res2 += p.first;
      }
    }
    for (auto p : odd) {
      for (long long i = 0; i < p.second; i++) {
        res2 += p.first;
      }
    }
    if (check(res1)) {
      cout << res1 << "\n";
    } else if (check(res2)) {
      cout << res2 << "\n";
    } else {
      cout << "No answer"
           << "\n";
    }
  }
  return 0;
}
