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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.FileInputStream;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BUglyPairs solver = new BUglyPairs();
        solver.solve(1, in, out);
        out.close();
    }

    static class BUglyPairs {
        private ArrayList<Integer>[] graph;
        private StringBuilder sb;
        private int[] present;
        private boolean[] vis;

        private void dfs(int start) {
            sb.append(Util.strm("" + (char) (start + 96), present[start]));
            vis[start] = true;
            for (int x : graph[start]) {
                if (!vis[x]) dfs(x);
            }
        }

        private boolean checkIfValid() {
            for (int i = 0; i < sb.length() - 1; i++) {
                char curr = sb.charAt(i), next = sb.charAt(i + 1);
                if (Math.abs(curr - next) == 1) return false;
            }
            return true;
        }

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int t = in.nextInt();
            loop:
            while (t-- > 0) {
                String str = in.nextLine();
                present = new int[27];
                for (int i = 0; i < str.length(); i++) {
                    present[str.charAt(i) - 96]++;
                }
                graph = new ArrayList[27];
                for (int i = 0; i <= 26; i++) {
                    graph[i] = new ArrayList<>();
                }
                for (int i = 1; i <= 26; i++) {
                    if (present[i] > 0) {
                        for (int j = 1; j <= 26; j++) {
                            if (present[j] > 0 && j != i - 1 && j != i && j != i + 1) {
                                graph[i].add(j);
                            }
                        }
                    }
                }
                for (int i = 1; i <= 26; i++) {
                    if (present[i] > 0) {
                        sb = new StringBuilder();
                        vis = new boolean[27];
                        dfs(i);
                        if (sb.length() == str.length() && checkIfValid()) {
                            out.println(sb);
                            continue loop;
                        }
                    }
                }
                out.println("No answer");
            }
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[8192];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public InputReader(FileInputStream file) {
            this.stream = file;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res = (res << 3) + (res << 1) + c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String nextLine() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isEndOfLine(c));
            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        private boolean isEndOfLine(int c) {
            return c == '\n' || c == '\r' || c == -1;
        }

    }

    static class Util {
        public static String strm(String str, long m) {
            String ans = "";
            while (m > 0) {
                if ((m & 1) == 1) ans = ans.concat(str);
                str = str.concat(str);
                m >>= 1;
            }
            return ans;
        }

    }
}