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 javax.print.DocFlavor;
import javax.swing.plaf.basic.BasicInternalFrameTitlePane;
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.nio.Buffer;
import java.sql.BatchUpdateException;
import java.util.*;
import java.util.stream.Stream;
import java.util.Vector;
import java.io.IOException;
import java.nio.file.Files;
import java.nio.file.Paths;
import static java.lang.Math.*;
import java.util.*;
import java.nio.file.StandardOpenOption;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Iterator;
import java.util.PriorityQueue;

public class icpc
{
    public static void main(String[] args)throws IOException
    {
//        Reader in = new Reader();
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

        int t = Integer.parseInt(in.readLine());
        for(int i=0;i<t;i++)
        {
            String s = in.readLine();
            int n = s.length();
            boolean flag = true;
            int[] A = new int[26];
            ArrayList<Character> h = new ArrayList<>();
            for(int j=0;j<n;j++)
            {
                A[s.charAt(j) - 'a']++;
                if(A[s.charAt(j) - 'a'] == 1)
                    h.add(s.charAt(j));
            }
            Collections.sort(h);
            if(h.size() == 2 && (h.get(0) - 'a' + 1) == (h.get(1) - 'a'))
            {
                flag = false;
            }
            else if(h.size() == 3 && (h.get(0) - 'a' + 1) == (h.get(1) - 'a') && (h.get(1) - 'a' + 1) == (h.get(2) - 'a'))
            {
                flag = false;
            }
            else if(h.size() == 1)
            {
                StringBuilder stringBuilder = new StringBuilder();
                for(int j= 0 ;j<A[h.get(0) - 'a'];j++)
                    stringBuilder.append(h.get(0));
                System.out.println(stringBuilder);
                continue;
            }
            if(!flag)
            {
                System.out.println("No answer");
                continue;
            }
            else
            {
                StringBuilder stringBuilder = new StringBuilder();
                int n1 = h.size();
                if(n1 % 2 == 0)
                {
                    for(int k=0;k<(n1/2) - 1;k++)
                    {
                        int size = A[h.get(k) - 'a'];
                        for(int j=0;j<size;j++)
                            stringBuilder.append(h.get(k));
                        size = A[h.get(n1 - k - 1) - 'a'];
                        for(int j=0;j<size;j++)
                            stringBuilder.append(h.get(n1 - k - 1));
                    }
                    for(int k=0;k<A[h.get(n1/ 2 - 1) - 'a'];k++)
                        stringBuilder.append(h.get(n1/2 - 1));

                    stringBuilder = stringBuilder.reverse();
                    for(int k=0;k<A[h.get(n1/ 2) - 'a'];k++)
                        stringBuilder.append(h.get(n1/2));
                    stringBuilder = stringBuilder.reverse();

                }
                else
                {
                    for(int k=0;k<n1/2;k++)
                    {
                        int size = A[h.get(k) - 'a'];
                        for(int j=0;j<size;j++)
                            stringBuilder.append(h.get(k));
                        size = A[h.get(n1 - k - 1) - 'a'];
                        for(int j=0;j<size;j++)
                            stringBuilder.append(h.get(n1 - k - 1));
                    }
                    if(n1 == 3)
                    {
                        int x1 = stringBuilder.charAt(0) - 'a';
                        int x2 = h.get(n1/ 2) - 'a';
                        if(x1 + 1 == x2 || x2 + 1 == x1)
                        {
                            for(int k=0;k<A[h.get(n1/2) - 'a'];k++)
                                stringBuilder.append(h.get(n1/2));
                        }
                        else
                        {
                            stringBuilder = stringBuilder.reverse();
                            for(int k=0;k<A[h.get(n1/2) - 'a'];k++)
                                stringBuilder.append(h.get(n1/2));
                            stringBuilder = stringBuilder.reverse();
                        }
                    }
                    else
                    {
                    stringBuilder = stringBuilder.reverse();
                    for(int k=0;k<A[h.get(n1/2) - 'a'];k++)
                        stringBuilder.append(h.get(n1/2));
                    stringBuilder = stringBuilder.reverse();
                    }
                }
                String s1 = stringBuilder.toString();
                boolean flag1 = true;
                for(int k=1;k<s1.length();k++)
                {
                    int last = s1.charAt(k-1) - 'a';
                    int now = s1.charAt(k) - 'a';
                    if((last + 1) == now || (now + 1) == last)
                    {
                        flag1 = false;
                        break;
                    }
                }
                if(flag1)
                    System.out.println(stringBuilder);
                else
                    System.out.println("No answer");
            }
        }
    }
}
class Matrix
{
    long a;
    long b;
    long c;
    long d;

    public Matrix(long a, long b, long c, long d)
    {
        this.a = a;
        this.b = b;
        this.c = c;
        this.d = d;
    }
}
class Game
{
    int x;
    int y;
    char d;

    public Game(int x, int y, char d)
    {
        this.x = x;
        this.y = y;
        this.d = d;
    }
}
class MergeSort
{
    // Merges two subarrays of arr[].
    // First subarray is arr[l..m]
    // Second subarray is arr[m+1..r]
    void merge(long arr[], int l, int m, int r)
    {
        // Find sizes of two subarrays to be merged
        int n1 = m - l + 1;
        int n2 = r - m;

        /* Create temp arrays */
        long L[] = new long [n1];
        long R[] = new long [n2];

        /*Copy data to temp arrays*/
        for (int i=0; i<n1; ++i)
            L[i] = arr[l + i];
        for (int j=0; j<n2; ++j)
            R[j] = arr[m + 1+ j];


        /* Merge the temp arrays */

        // Initial indexes of first and second subarrays
        int i = 0, j = 0;

        // Initial index of merged subarry array
        int k = l;
        while (i < n1 && j < n2)
        {
            if (L[i] <= R[j])
            {
                arr[k] = L[i];
                i++;
            }
            else
            {
                arr[k] = R[j];
                j++;
            }
            k++;
        }

        /* Copy remaining elements of L[] if any */
        while (i < n1)
        {
            arr[k] = L[i];
            i++;
            k++;
        }

        /* Copy remaining elements of R[] if any */
        while (j < n2)
        {
            arr[k] = R[j];
            j++;
            k++;
        }
    }

    // Main function that sorts arr[l..r] using
    // merge()
    void sort(long arr[], int l, int r)
    {
        if (l < r)
        {
            // Find the middle point
            int m = (l+r)/2;

            // Sort first and second halves
            sort(arr, l, m);
            sort(arr , m+1, r);

            // Merge the sorted halves
            merge(arr, l, m, r);
        }
    }
}
class Node
{
    String a;
    String b;
    Node(String s1,String s2)
    {
        this.a = s1;
        this.b = s2;
    }
    @Override
    public boolean equals(Object ob)
    {
        if(ob == null)
            return false;
        if(!(ob instanceof Node))
            return false;
        if(ob == this)
            return true;
        Node obj = (Node)ob;
        if(this.a.equals(obj.a) && this.b.equals(obj.b))
            return true;
        return false;
    }

    @Override
    public int hashCode()
    {
        return (int)this.a.length();
    }
}
class Reader
{
    final private int BUFFER_SIZE = 1 << 16;
    private DataInputStream din;
    private byte[] buffer;
    private int bufferPointer, bytesRead;

    public Reader()
    {
        din = new DataInputStream(System.in);
        buffer = new byte[BUFFER_SIZE];
        bufferPointer = bytesRead = 0;
    }

    public Reader(String file_name) throws IOException
    {
        din = new DataInputStream(new FileInputStream(file_name));
        buffer = new byte[BUFFER_SIZE];
        bufferPointer = bytesRead = 0;
    }

    public String readLine() throws IOException
    {
        byte[] buf = new byte[64]; // line length
        int cnt = 0, c;
        while ((c = read()) != -1)
        {
            if (c == '\n')
                break;
            buf[cnt++] = (byte) c;
        }
        return new String(buf, 0, cnt);
    }

    public int nextInt() throws IOException
    {
        int ret = 0;
        byte c = read();
        while (c <= ' ')
            c = read();
        boolean neg = (c == '-');
        if (neg)
            c = read();
        do
        {
            ret = ret * 10 + c - '0';
        }  while ((c = read()) >= '0' && c <= '9');

        if (neg)
            return -ret;
        return ret;
    }

    public long nextLong() throws IOException
    {
        long ret = 0;
        byte c = read();
        while (c <= ' ')
            c = read();
        boolean neg = (c == '-');
        if (neg)
            c = read();
        do {
            ret = ret * 10 + c - '0';
        }
        while ((c = read()) >= '0' && c <= '9');
        if (neg)
            return -ret;
        return ret;
    }

    public double nextDouble() throws IOException
    {
        double ret = 0, div = 1;
        byte c = read();
        while (c <= ' ')
            c = read();
        boolean neg = (c == '-');
        if (neg)
            c = read();

        do {
            ret = ret * 10 + c - '0';
        }
        while ((c = read()) >= '0' && c <= '9');

        if (c == '.')
        {
            while ((c = read()) >= '0' && c <= '9')
            {
                ret += (c - '0') / (div *= 10);
            }
        }

        if (neg)
            return -ret;
        return ret;
    }

    private void fillBuffer() throws IOException
    {
        bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
        if (bytesRead == -1)
            buffer[0] = -1;
    }

    private byte read() throws IOException
    {
        if (bufferPointer == bytesRead)
            fillBuffer();
        return buffer[bufferPointer++];
    }

    public void close() throws IOException
    {
        if (din == null)
            return;
        din.close();
    }
}
class Hey
{
    public static int multTwoNumbers(int a, int b, int n)
    {
        if(a == 0)
            return 0;
        else if(a % 2 == 0)
            return (2 * ((multTwoNumbers(a / 2, b, n)) % n))% n;
        else
            return ((2 * ((multTwoNumbers((a - 1) / 2, b, n)) % n))% n + b) % n;
    }
    public static long binPow(long a, long n)
    {
        long res = 1L;
        while (n > 0)
        {
            if((n & 1) > 0)
            {
                res *= a;
            }
            a *= a;
            n >>= 1;
        }
        return res;
    }
    public static long phi(long n)
    {
        long result = n;
        for(int i=2;i*i <= n;i++)
        {
            if(n % i == 0)
            {
                while(n % i == 0)
                    n = n / i;
                result -= result / (long)i;
            }
        }
        if(n > 1)
            result -= result / n;
        return result;
    }
}
class FenwickTree
{
    public void update(long[] fenwickTree,long delta,int index)
    {
        index += 1;
        while(index < fenwickTree.length)
        {
            fenwickTree[index] += delta;
            index = index + (index & (-index));
        }
    }
    public long prefixSum(long[] fenwickTree,int index)
    {
        long sum = 0L;
        index += 1;
        while(index > 0)
        {
            sum += fenwickTree[index];
            index -= (index & (-index));
        }
        return sum;
    }
}
class SegmentTree
{
    public int nextPowerOfTwo(int num)
    {
        if(num == 0)
            return 1;
        if(num > 0 && (num & (num - 1)) == 0)
            return num;
        while((num &(num - 1)) > 0)
        {
            num = num & (num - 1);
        }
        return num << 1;
    }
    public int[] createSegmentTree(int[] input)
    {
        int np2 = nextPowerOfTwo(input.length);
        int[] segmentTree = new int[np2 * 2 - 1];

        for(int i=0;i<segmentTree.length;i++)
            segmentTree[i] = Integer.MIN_VALUE;

        constructSegmentTree(segmentTree,input,0,input.length-1,0);
        return segmentTree;

    }
    private void constructSegmentTree(int[] segmentTree,int[] input,int low,int high,int pos)
    {
        if(low == high)
        {
            segmentTree[pos] = input[low];
            return;
        }
        int mid = (low + high)/ 2;
        constructSegmentTree(segmentTree,input,low,mid,2*pos + 1);
        constructSegmentTree(segmentTree,input,mid+1,high,2*pos + 2);
        segmentTree[pos] = Math.max(segmentTree[2*pos + 1],segmentTree[2*pos + 2]);
    }
    public int rangeMinimumQuery(int []segmentTree,int qlow,int qhigh,int len)
    {
        return rangeMinimumQuery(segmentTree,0,len-1,qlow,qhigh,0);
    }
    private int rangeMinimumQuery(int segmentTree[],int low,int high,int qlow,int qhigh,int pos)
    {
        if(qlow <= low && qhigh >= high){
            return segmentTree[pos];
        }
        if(qlow > high || qhigh < low){
            return Integer.MIN_VALUE;
        }
        int mid = (low+high)/2;
        return Math.max(rangeMinimumQuery(segmentTree, low, mid, qlow, qhigh, 2 * pos + 1),
                rangeMinimumQuery(segmentTree, mid + 1, high, qlow, qhigh, 2 * pos + 2));
    }
}