#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
template <typename T>
T pow(T a, T b, long long int m) {
  T ans = 1;
  while (b > 0) {
    if (b % 2 == 1) ans = ((ans % m) * (a % m)) % m;
    b /= 2;
    a = ((a % m) * (a % m)) % m;
  }
  return ans % m;
}
template <typename T>
void tracev(vector<T> &a) {
  for (auto &i : a) {
    cout << i << ' ';
  }
  cout << '\n';
}
template <typename T>
void tracevv(vector<T> &a) {
  for (auto &i : a) {
    tracev(i);
  }
}
template <typename T>
void tracevp(T &a) {
  for (auto &i : a) {
    cout << "i.ff"
         << ": " << i.first << " | "
         << "i.ss"
         << ": " << i.second << "\n";
    ;
  }
  cout << '\n';
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    map<char, int> m;
    for (int i = 0; i < s.length(); i++) {
      if (m.find(s[i]) == m.end())
        m[s[i]] = 1;
      else
        m[s[i]]++;
    }
    vector<char> ans;
    ans.push_back(m.begin()->first);
    bool f = true;
    for (auto i = m.rbegin(); i != m.rend(); i++) {
      auto q = i;
      q++;
      if (q == m.rend()) break;
      if (f) {
        ans.push_back(i->first);
      } else
        ans.insert(ans.begin(), i->first);
      f = !f;
    }
    bool first = true;
    for (int i = 0; i < ans.size() - 1; i++) {
      if (abs(ans[i] - ans[i + 1]) == 1) {
        first = false;
        break;
      }
    }
    if (first) {
      for (int i = 0; i < ans.size(); i++) {
        for (int j = 0; j < m[ans[i]]; j++) {
          cout << ans[i];
        }
      }
      cout << '\n';
    } else {
      if (m.size() == 3) {
        vector<vector<int> > b = {{0, 1, 2}, {1, 0, 2}, {2, 0, 1}};
        for (int ii = 0; ii < 3; ii++) {
          if (abs(ans[b[ii][0]] - ans[b[ii][1]]) != 1 &&
              abs(ans[b[ii][0]] - ans[b[ii][2]]) != 1) {
            for (int i = 0; i < m[ans[b[ii][1]]]; i++) cout << ans[b[ii][1]];
            for (int i = 0; i < m[ans[b[ii][0]]]; i++) cout << ans[b[ii][0]];
            for (int i = 0; i < m[ans[b[ii][2]]]; i++) cout << ans[b[ii][2]];
            cout << '\n';
            first = true;
            break;
          }
        }
      }
      if (!first) cout << "No answer\n";
    }
  }
  return 0;
}
