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.util.*;
import java.io.*;
import java.math.*;
public class aprail152
{
    static class InputReader {
        public BufferedReader br;
        public StringTokenizer token;
        public InputReader(InputStream stream)
        {
            br=new BufferedReader(new InputStreamReader(stream),32768);
            token=null;
        }

        public String next()
        {
            while(token==null || !token.hasMoreTokens())
            {
                try
                {
                    token=new StringTokenizer(br.readLine());
                }
                catch(IOException e)
                {
                    throw new RuntimeException(e);
                }
            }
            return token.nextToken();
        }

        public int nextInt()
        {
            return Integer.parseInt(next());
        }

        public long nextLong()
        {
            return Long.parseLong(next());
        }
    }
    /*static class card{
    long up;
    int down;
    public card(long u,int d)
    {
    this.up=u;
    this.down=d;
    }
    }
    static class sort implements Comparator<card>
    {
    public int compare(card o1,card o2)
    {
    if(o1.up!=o2.up)
    return (int)(o1.up-o2.up);
    else
    return (int)(o1.down-o2.down);
    }
    }
    static void shuffle(long a[])
    {
    List<Long> l=new ArrayList<>();
    for(int i=0;i<a.length;i++)
    l.add(a[i]);
    Collections.shuffle(l);
    for(int i=0;i<a.length;i++)
    a[i]=l.get(i);
    }

    static long gcd(long a,long b)
    {
    if(b==0)
    return a;
    else
    return gcd(b,a%b);
    }
    static int ans1=Integer.MAX_VALUE,ans2=Integer.MAX_VALUE,ans3=Integer.MAX_VALUE,ans4=Integer.MAX_VALUE;
    static boolean v[]=new boolean[101];
    static void dfs(Integer so,Set<Integer> s[]){
    if(!v[so.intValue()])
    {
    v[so]=true;
    for(Integer h:s[so.intValue()])
    {
    if(!v[h.intValue()])
    dfs(h,s);
    }
    }
    }
    static class Print{
    public PrintWriter out;
    Print(OutputStream o)
    {
    out=new PrintWriter(o);
    }
    }
    static int CeilIndex(int A[], int l, int r, int key) 
    { 
    while (r - l > 1) { 
    int m = l + (r - l) / 2; 
    if (A[m] >= key) 
    r = m; 
    else
    l = m; 
    } 

    return r; 
    } 

    static int LongestIncreasingSubsequenceLength(int A[], int size) 
    { 
    // Add boundary case, when array size is one 
    int[] tailTable = new int[size]; 
    int len; // always points empty slot 
    tailTable[0] = A[0]; 
    len = 1; 
    for (int i = 1; i < size; i++) { 
    if (A[i] < tailTable[0]) 
    // new smallest value 
    tailTable[0] = A[i]; 

    else if (A[i] > tailTable[len - 1]) 
    // A[i] wants to extend largest subsequence 
    tailTable[len++] = A[i]; 

    else
    // A[i] wants to be current end candidate of an existing 
    // subsequence. It will replace ceil value in tailTable 
    tailTable[CeilIndex(tailTable, -1, len - 1, A[i])] = A[i]; 
    } 
    return len; 
    }*/
    /*static int binary(int n)
    {
    int s=1;
    while(n>0)
    {
    s=s<<1;
    n--;
    }
    return s-1;
    }
    static StringBuilder bin(int i,int n)
    {
    StringBuilder s=new StringBuilder();
    while(i>0)
    {
    s.append(i%2);
    i=i/2;
    }
    while(s.length()!=n)
    {
    s.append(0);
    }
    return s.reverse();
    }*/
    public static void main(String args[])
    {
        InputReader sc=new InputReader(System.in);
        int n=sc.nextInt();
        while(n>0)
        {
            StringBuilder sb=new StringBuilder();
            char c[]=sc.next().toCharArray();
            int v[]=new int[125];
            Set<Character> s=new TreeSet<>();
            for(int i=0;i<c.length;i++)
            {
                v[c[i]]++; 
                s.add(c[i]);
            }
            char ch[]=new char[s.size()];
            int p=0;int len=s.size(),sum=0;
            StringBuilder sb1=new StringBuilder();
            for(Character h:s)
            {
                ch[p]=h;p++;
                sb1.append(h);
            }
            for(int i=1;i<len;i++)
            {
                if(ch[i]-ch[i-1]==1)
                    sum+=1;
                else
                    break;
            }
            if(sum==len-1 && (len==2 || len==3))
            {
                System.out.println("No answer");
            }
            else
            {
                int f=0;String st="";
                for(int i=0,j=len-1;;i++,j--)
                {
                    if(j==i)
                    {
                        if(len%2!=0)
                        {
                            String w="";
                            if(len!=3)
                             w=st.substring(0,st.length()/2)+ch[j]+st.substring(st.length()/2);
                             else
                             {
                                 if(ch[i]-st.charAt(0)==1)
                                 w=st.substring(0,st.length()/2)+st.substring(st.length()/2)+ch[j];
                                 else
                                 w=ch[j]+st.substring(0,st.length()/2)+st.substring(st.length()/2);
                             }
                            st=w;
                            break;
                        }
                        else
                            break;
                    }
                    else if(i<j)
                    {
                        if(f%2==0)
                        {
                            st=ch[i]+st+ch[j]; 
                        }
                        else
                            st=ch[j]+st+ch[i];
                        f++;
                    }
                    else break;
                }
                for(int i=0;i<len;i++)
                {
                    char t=st.charAt(i);
                    sb.append(t);
                    if((--v[t])>0)
                    {
                        while(v[t]>0)
                        {
                            sb.append(t);
                            v[t]--;
                        }
                    }
                }
                System.out.println(sb);
            }
            n--;
        }
    }
}