#include <bits/stdc++.h>
void solve() {
  std::string s;
  std::cin >> s;
  int flag = s[0] & 1, ok = 1;
  for (int i = 1; i < s.length(); i++) {
    if ((s[i] & 1) != flag) {
      ok = 0;
      break;
    }
  }
  if (ok) {
    std::cout << s << "\n";
    return;
  }
  for (int i = 0; i < s.length(); i++) {
    for (int j = i + 1; j < s.length(); j++) {
      if ((s[i] & 1) != (s[j] & 1) && abs(s[i] - s[j]) > 1) {
        for (int k = 0; k < s.length(); k++) {
          if (k != i && (s[k] & 1) == (s[i] & 1)) {
            std::cout << s[k];
          }
        }
        std::cout << s[i] << s[j];
        for (int k = 0; k < s.length(); k++) {
          if (k != j && (s[k] & 1) == (s[j] & 1)) {
            std::cout << s[k];
          }
        }
        std::cout << "\n";
        return;
      }
    }
  }
  std::cout << "No answer\n";
  return;
}
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout.tie(nullptr);
  int T = 1;
  std::cin >> T;
  while (T--) solve();
  return 0;
}
