Problem: You are given a string, consisting of lowercase Latin letters.

A pair of neighbouring letters in a string is considered ugly if these letters are also neighbouring in a alphabet. For example, string "abaca" contains ugly pairs at positions (1, 2) — "ab" and (2, 3) — "ba". Letters 'a' and 'z' aren't considered neighbouring in a alphabet.

Can you rearrange the letters of a given string so that there are no ugly pairs? You can choose any order of the letters of the given string but you can't add any new letters or remove the existing ones. You can also leave the order the same.

If there are multiple answers, print any of them.

You also have to answer T separate queries.

Input

The first line contains a single integer T (1 ≤ T ≤ 100) — the number of queries.

Each of the next T lines contains string s (1 ≤ |s| ≤ 100) — the string for the next query. It is guaranteed that it contains only lowercase Latin letters.

Note that in hacks you have to set T = 1.

Output

Print T lines. The i-th line should contain the answer to the i-th query.

If the answer for the i-th query exists, then print such a rearrangment of letters of the given string that it contains no ugly pairs. You can choose any order of the letters of the given string but you can't add any new letters or remove the existing ones. You can also leave the order the same.

If there are multiple answers, print any of them.

Otherwise print "No answer" for that query.

Example

Input


4
abcd
gg
codeforces
abaca


Output


cadb
gg
codfoerces
No answer

Note

In the first example answer "bdac" is also correct.

The second example showcases the fact that only neighbouring in alphabet letters are not allowed. The same letter is ok.

There are lots of valid answers for the third example.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int t, n, tp[50], mx, vis[100005], vis2[100005];
char s[105];
vector<int> v[55];
void dfs(int node, int sira) {
  if (vis[node] == 1) return;
  mx = max(mx, sira);
  vis[node] = 1;
  for (int j = 0; j < (int)v[node].size(); j++) {
    int go = v[node][j];
    dfs(go, sira + 1);
  }
}
void dfs2(int bas) {
  if (vis2[bas] == 1) return;
  vis2[bas] = 1;
  for (int i = 1; i <= tp[bas]; i++) {
    char q = bas + 'a';
    printf("%c", q);
  }
  for (int j = 0; j < (int)v[bas].size(); j++) {
    int go = v[bas][j];
    dfs2(go);
  }
}
int main() {
  scanf("%d", &t);
  for (int i = 1; i <= t; i++) {
    scanf("%s", s + 1);
    n = strlen(s + 1);
    memset(tp, 0, sizeof(tp));
    for (int j = 0; j <= 25; j++) v[j].clear();
    for (int j = 1; j <= n; j++) tp[s[j] - 'a']++;
    for (int j = 0; j <= 25; j++) {
      for (int k = 0; k <= 25; k++) {
        if (j == k || abs(j - k) == 1 || tp[j] == 0 || tp[k] == 0) continue;
        v[j].push_back(k);
        v[k].push_back(j);
      }
    }
    int say = 0;
    for (int j = 0; j <= 25; j++) {
      if (tp[j] > 0) say++;
    }
    int tut = -1;
    for (int j = 0; j <= 25; j++) {
      if (tp[j] == 0) continue;
      mx = 0;
      memset(vis, 0, sizeof(vis));
      dfs(j, 1);
      if (mx == say) {
        tut = j;
        break;
      }
    }
    if (tut == -1)
      printf("No answer\n");
    else {
      memset(vis2, 0, sizeof(vis2));
      dfs2(tut);
      printf("\n");
    }
  }
  return 0;
}