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.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.TreeSet;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

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

    static class BUglyPairs {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int t = in.nextInt();

            o:
            while (t-- > 0) {
                String s = in.next();

                int n = s.length();

                int[] h = new int[26];

                TreeSet<Integer> cs = new TreeSet<>();

                for (char c : s.toCharArray()) {
                    h[c - 'a']++;
                    cs.add(c - 'a');
                }

                char[] ans = new char[n];

                int k = 0;

                if (cs.size() == 3) {
                    int f = cs.first();
                    cs.remove(f);
                    int se = cs.first();
                    cs.remove(se);
                    int th = cs.first();

                    if (f + 1 == se && se + 1 == th) {
                        out.println("No answer");
                        continue o;
                    } else if (f + 1 == se) {
                        for (int j = 0; j < h[f]; j++) {
                            ans[k++] = (char) (f + 'a');
                        }

                        for (int j = 0; j < h[th]; j++) {
                            ans[k++] = (char) (th + 'a');
                        }

                        for (int j = 0; j < h[se]; j++) {
                            ans[k++] = (char) (se + 'a');
                        }

                        out.println(String.valueOf(ans));
                        continue o;
                    } else if (se + 1 == th) {
                        for (int j = 0; j < h[th]; j++) {
                            ans[k++] = (char) (th + 'a');
                        }

                        for (int j = 0; j < h[f]; j++) {
                            ans[k++] = (char) (f + 'a');
                        }

                        for (int j = 0; j < h[se]; j++) {
                            ans[k++] = (char) (se + 'a');
                        }

                        out.println(String.valueOf(ans));
                        continue o;
                    }
                }


                int va = 0;
                int lc = -4;
                for (int i = 0; i < 26; i++) {
                    if (h[i] > 0) {
                        va = 1 - va;

                        if (va == 0) {
                            for (int j = 0; j < h[i]; j++) {
                                ans[k++] = (char) (i + 'a');
                            }
                            lc = i;
                        }
                    }
                }

                va = 1;

                for (int i = 0; i < 26; i++) {
                    if (h[i] > 0) {
                        va = 1 - va;

                        if (va == 0) {
                            if (isAdj(i, lc)) {
                                out.println("No answer");
                                continue o;
                            }
                            for (int j = 0; j < h[i]; j++) {
                                ans[k++] = (char) (i + 'a');
                            }
                            lc = i;
                        }
                    }
                }

                out.println(String.valueOf(ans));
            }
        }

        boolean isAdj(int a, int b) {
            if (a + 1 == b)
                return true;

            if (b + 1 == a)
                return true;

            return false;
        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void println(Object... objects) {
            print(objects);
            writer.println();
        }

        public void close() {
            writer.close();
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

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

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        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 *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String nextString() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
                if (Character.isValidCodePoint(c)) {
                    res.appendCodePoint(c);
                }
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public String next() {
            return nextString();
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}