#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ull = uint64_t;
constexpr ll INF = 1000000000;
namespace utils {
class Repeater {
  int st;
  int ed;
  int d;

 public:
  class rep_iterator {
    int i;
    int d;

   public:
    rep_iterator(int x, int pd) : i(x), d(pd) {}
    int& operator*() { return i; }
    bool operator==(const rep_iterator& k) const { return i == k.i; }
    bool operator!=(const rep_iterator& k) const { return i != k.i; }
    rep_iterator& operator++() {
      i += d;
      return *this;
    }
  };
  explicit Repeater(int N) : st(0), ed(N), d(1) {}
  Repeater(int b, int e) : st(b), ed(e), d(1) {
    if (st > ed) {
      st--;
      ed--;
      d = -1;
    }
  }
  rep_iterator begin() const { return rep_iterator(st, d); }
  rep_iterator end() const { return rep_iterator(ed, d); }
};
template <class T, class Compare>
using p_queue = priority_queue<T, vector<T>, Compare>;
template <class T>
using min_queue = p_queue<T, greater<T>>;
template <class T>
using max_queue = p_queue<T, less<T>>;
template <class T>
bool min_update(T& X, const T& A) {
  if (X > A) {
    X = A;
    return true;
  }
  return false;
}
template <class T>
bool max_update(T& X, const T& A) {
  if (X < A) {
    X = A;
    return true;
  }
  return false;
}
}  // namespace utils
using namespace utils;
void sub_main(istream& is) {
  ll N;
  is >> N;
  if (!is) return;
  for (auto&& i : Repeater(0, N)) {
    string S;
    is >> S;
    vector<int> alp('z' - 'a' + 1);
    for (auto&& c : S) {
      alp[c - 'a']++;
    }
    int count = S.size();
    int prev = -2;
    string ans;
    while (count > 0) {
      int mdeg = -1;
      int mc = -1;
      for (auto&& c : Repeater(0, alp.size())) {
        if (alp[c] == 0) continue;
        if (abs(c - prev) == 1) {
          continue;
        }
        int pre = c == 0 ? alp.back() : alp[c - 1];
        int next = c == alp.size() - 1 ? alp.front() : alp[c + 1];
        if (max_update(mdeg, (pre > 0) + (next > 0))) {
          mc = c;
        }
      }
      if (mc == -1) {
        cout << "No answer\n";
        break;
      }
      prev = mc;
      while (alp[mc] > 0) {
        ans.push_back(mc + 'a');
        alp[mc]--;
        count--;
      }
    }
    if (count == 0) cout << ans << endl;
  }
}
int main(int argc, char* argv[]) {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << setprecision(16) << scientific;
  sub_main(cin);
  return 0;
}
