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.BufferedInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;

public class B {

	public static void main(String[] args) {
		JS in = new JS();
		PrintWriter out = new PrintWriter(System.out);
		
		int T = in.nextInt();
		for(int runs = 1; runs <= T; runs++) {
			char c[] = in.next().toCharArray();
			int N = c.length;
			int freq[] = new int[26];
			int freq2[] = new int[26];
			
			for(int i = 0; i < N; i++) {
				freq[c[i]-'a']++;
				freq2[c[i]-'a']++;
			}
			
			char res[] = new char[N];
			int id = 0;
			boolean skip = true;
			for(int i = 0; i < 26; i++) {
				if(freq[i] > 0) {
					if(skip) {
						skip = false;
						continue;
					}
					else skip = true;				
					for(int j = 0; j < freq[i]; j++) res[id++] = (char)('a'+i);
					freq[i] = 0;
				}
			}
			
			for(int i = 0; i < 26; i++) {
				if(freq[i] > 0) {
					for(int j = 0; j < freq[i]; j++) res[id++] = (char)('a'+i);
				}
			}
			
			boolean good = true;
			for(int i = 0; i < N-1; i++) {
				if(Math.abs(res[i]-res[i+1]) == 1) good = false;
			}
			if(!good) {
				id = 0;
				skip = false;
				freq = freq2;
				for(int i = 0; i < 26; i++) {
					if(freq[i] > 0) {
						if(skip) {
							skip = false;
							continue;
						}
						else skip = true;				
						for(int j = 0; j < freq[i]; j++) res[id++] = (char)('a'+i);
						freq[i] = 0;
					}
				}
				
				for(int i = 0; i < 26; i++) {
					if(freq[i] > 0) {
						for(int j = 0; j < freq[i]; j++) res[id++] = (char)('a'+i);
					}
				}
//				System.out.println(new String(res));
				good = true;
				for(int i = 0; i < N-1; i++) {
					if(Math.abs(res[i]-res[i+1]) == 1) good = false;
				}
			}
			
			
			if(!good) {	
				out.println("No answer");
			}
			else {
				out.println(new String(res));
			}
			
		}
		out.close();
	}

	
	static class JS{
		public int BS = 1<<16;
		public char NC = (char)0;
		byte[] buf = new byte[BS];
		int bId = 0, size = 0;
		char c = NC;
		double num = 1;
		BufferedInputStream in;
		
		public JS() {
			in = new BufferedInputStream(System.in, BS);
		}
		
		public JS(String s) throws FileNotFoundException {
			in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
		}
		
		public char nextChar(){
			while(bId==size) {
				try {
					size = in.read(buf);
				}catch(Exception e) {
					return NC;
				}				
				if(size==-1)return NC;
				bId=0;
			}
			return (char)buf[bId++];
		}
		
		public int nextInt() {
			return (int)nextLong();
		}
		
		public long nextLong() {
			num=1;
			boolean neg = false;
			if(c==NC)c=nextChar();
			for(;(c<'0' || c>'9'); c = nextChar()) {
				if(c=='-')neg=true;
			}
			long res = 0;
			for(; c>='0' && c <='9'; c=nextChar()) {
				res = (res<<3)+(res<<1)+c-'0';
				num*=10;
			}
			return neg?-res:res;
		}
		
		public double nextDouble() {
		    while(c!='.'&&c!='-'&&(c <'0' || c>'9')) c = nextChar();
		    boolean neg = c=='-';
		    if(neg)c=nextChar();
		    boolean fl = c=='.';
		    double cur = nextLong();
		    if(fl) return neg ? -cur/num : cur/num;
		    if(c == '.') {
			double next = nextLong();
			return neg ? -cur-next/num : cur+next/num;
		    }
		    else return neg ? -cur : cur;
		}
		
		public String next() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c>32) {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}
		
		public String nextLine() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c!='\n') {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}

		public boolean hasNext() {
			if(c>32)return true;
			while(true) {
				c=nextChar();
				if(c==NC)return false;
				else if(c>32)return true;
			}
		}
	}
	
}