#include <bits/stdc++.h>
using namespace std;
typedef int (*uniopi)(int);
typedef long long (*uniopl)(long long);
typedef int (*binopi)(int, int);
typedef long long (*binopl)(long long, long long);
typedef int (*tupopi)(int, int, int);
typedef long long (*tupopl)(long long, long long, long long);
const long double PI = acos(0) * 2;
const int INF = 0x3f2f1f0f;
const long long LINF = 1ll * INF * INF;
int X4[] = {-1, 0, 1, 0}, Y4[] = {0, -1, 0, 1};
int X8[] = {-1, -1, -1, 0, 1, 1, 1, 0}, Y8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
template <typename T>
inline bool uax(T& a, T b) {
  return a < b ? (a = b, 1) : 0;
}
template <typename T>
inline bool uin(T& a, T b) {
  return a > b ? (a = b, 1) : 0;
}
template <typename T1, typename T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << '(' << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i];
    if (i + 1 < (int)v.size()) os << ' ';
  }
  return os;
}
const int MX = 'z' - 'a' + 1;
int find_next(int a, vector<int>& vst, vector<int>& ex) {
  for (int b = a + 2; b < MX; b++) {
    if (ex[b] && !vst[b]) return b;
  }
  for (int b = 0; b < a - 1; b++) {
    if (ex[b] && !vst[b]) return b;
  }
  return -1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(nullptr);
  cout << std::setprecision(10);
  cout << fixed;
  int q;
  cin >> q;
  while (q--) {
    string s;
    cin >> s;
    int n = ((int)(s).size());
    vector<int> v;
    for (int i = 0; i < (n); i++) v.push_back(s[i] - 'a');
    vector<int> vst(MX, 0), ex(MX, 0);
    for (int i = 0; i < (n); i++) {
      ex[v[i]]++;
    }
    int nk = 0;
    for (int i = 0; i < (MX); i++) {
      if (ex[i]) nk++;
    }
    int pos = 0;
    vector<int> rpath;
    for (int i = 0; i < (MX); i++) {
      vector<int> path;
      fill((vst).begin(), (vst).end(), 0);
      if (!ex[i]) continue;
      for (int a = i; a != -1; a = find_next(a, vst, ex)) {
        vst[a] = 1;
        path.push_back(a);
      }
      if (((int)(path).size()) == nk) {
        pos = i + 1;
        rpath = path;
        break;
      }
    }
    if (pos) {
      for (auto a : rpath) {
        char c = a + 'a';
        for (int __i = 0; __i < (ex[a]); __i++) cout << c;
      }
      cout << endl;
    } else {
      cout << "No answer" << endl;
    }
  }
  return 0;
}
