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 JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class d extends PrintWriter{
    static BufferedReader s = new BufferedReader(new InputStreamReader(System.in));
    // static Scanner s=new Scanner(System.in);
    d() { super(System.out); }
    public static void main(String[] args) throws IOException{
        d d1=new d();d1.main();d1.flush();
    }void main() throws IOException {
        StringBuilder sb = new StringBuilder();
        PrintWriter out = new PrintWriter(System.out);
         String[] s1=s();
         int t=i(s1[0]);
         while(t-->0){
             char[] a=s()[0].toCharArray();
             Arrays.sort(a);int n=a.length;
             int count=1;
             for(int i=1;i<n;i++){
                 if(a[i]!=a[i-1]){
                     count++;
                 }
             }
             if(count==1){StringBuilder sb1=new StringBuilder();
                 for(int i=0;i<n;i++){
                     sb1.append(a[i]);
                 }
                 System.out.println(sb1.toString());
             }
            else if(count<=3){
                 {int flag=0;
                     for(int i=1;i<n;i++){
                         if(a[i]!=a[i-1]){
                             if(a[i-1]+1==a[i]){
                                 flag++;
                             };
                         }
                     }
                     if(flag==0){
                         StringBuilder sb1=new StringBuilder();
                         for(int i=0;i<n;i++) sb1.append(a[i]);
                         System.out.println(sb1.toString());
                     }
                     else if(flag==1&&count==3){
                          flag=0;int[] vis=new int[n];
                         StringBuilder sb1=new StringBuilder();
                         StringBuilder c1=new StringBuilder();
                         StringBuilder c2=new StringBuilder();
                         StringBuilder c3=new StringBuilder();
                         int khatra=0;
                         for(int i=0;i<n;i++){
                             if(i>0&&a[i]!=a[i-1]) flag++;
                             if(i>0&&a[i]-a[i-1]==1){
                                 khatra=flag;
                             }
                             if(flag==0)  c1.append(a[i]);
                             else if(flag==1) c2.append(a[i]);
                             else c3.append(a[i]);
                         }
                         if(khatra==1){
                             System.out.println(c1.toString()+c3+c2);
                         }else{
                             System.out.println(c2+c1.toString()+c3);
                         }

                     }
                     else{
                         System.out.println("No answer");
                     }
                 }

             }else{
                 int flag=1;int[] vis=new int[n];
                 StringBuilder sb1=new StringBuilder();
                 for(int i=0;i<n;i++){
                     if(i>0&&a[i]!=a[i-1]) flag^=1;
                     if(flag==0){
                         sb1.append(a[i]);
                         vis[i]=1;
                     }
                 }
                 for(int i=0;i<n;i++){
                     if(vis[i]==0){
                         sb1.append(a[i]);
                     }
                 }
                 System.out.println(sb1.toString());
             }
         }
    }
      static int ft;static int ans;
    static boolean dfs(int i,int des,ArrayList<Integer> [] adj,int [] vis){
        vis[i]=1;
        if(i==des) return true;
        if(adj[i]==null) return false;
        for(Integer j:adj[i]){
            if(vis[j]==0){
                if(dfs(j,des,adj,vis)==true) return true;
            }
        }vis[i]=0;
        return false;
    }
      static void bfs(int i,int n,ArrayList<Integer> [] adj,int [] vis){
        //int[] vis=new int[n+1];
        Queue<Integer> q=new LinkedList<>();
        q.add(i);vis[i]=1;
        while(!q.isEmpty()){
             i=q.poll();

            ft=i;
            for(Integer j:adj[i]){
                if(vis[j]==0){
                    q.add(j);vis[j]=vis[i]+1;
                }
            }
        }
    }
    static String[] s() throws IOException {

        return s.readLine().trim().split("\\s+");
    }

    static int i(String ss) {
        return Integer.parseInt(ss);
    }
    static long l(String ss) {
        return Long.parseLong(ss);
    }
}
class node implements Comparator<node>{
    int ver,val;
    public node(){}
    public node(int ver,int val) {
        this.ver=ver;this.val=val;
    }public int compare(node n1,node n2){
       return n1.val-n2.val;
    }
}

class Student12 {
    int  l;long r;
    public Student12(int l, long r) {
        this.l = l;
        this.r = r;
    }

    public String toString()
    {
        return this.l+" ";
    }
}
class Sortbyroll12 implements Comparator<Student12> {

    public int compare(Student12 a, Student12 b){
        if(a.r<b.r) return 1;else if(a.r==b.r) return 0;else return -1;// a.r-b.r;
      /*  if(b.r<a.r) return -1;
        else if(b.r==a.r) return 0;
        return 1;*/

        //   return b.r-a.r;
       /*
       if(b.l<a.l) return -1;
       else if(b.l==a.l) {
           return b.r-a.r;
       }
       return 1;*/
        //        return b.r- a.r;
        //        return (int) a.l-(int) b.l;
         /*   if(a.r<b.r) return -1;
            else if(a.r==b.r){
                if(a.r==b.r){
                    return 0;
                }
                if(a.r<b.r) return -1;
                return 1;}
            return 1;  */}
}
class Node1 implements Comparator<Node1>{
    int node;long val;
    public  Node1(){}
    public  Node1(int node,long val){
        this.node=node;this.val=val;
    }
    @Override
    public int compare(Node1 a,Node1 b){
        if(a.val<b.val) return -1;
        if(a.val==b.val) return 0;
        {
            return 1;
        }
    }
}