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.io.FileWriter; 

// Solution

public class Main 
{    
  public static void main (String[] argv) throws IOException
  {
	  new Main();
  } 
     
     
  
  boolean test = false;  
  
  final int MOD = 998244353;  //1000000007;
  
  public Main()   {
	FastReader in = new FastReader(new BufferedReader(new InputStreamReader(System.in)));
	
     
    //FastReader in = new FastReader(new BufferedReader(new FileReader("Main.in")));
    int n = in.nextInt();
    
    for (int i = 0; i < n; i++) {
        char[] a = in.next().toCharArray();
        System.out.println(solve(a));
    }
  }
  
  private String solve(char[] a) {      
      final int R = 26;
      int[] cnt = new int[R];
      for (char c : a) 
          cnt[c - 'a']++;
      Deque<Job> jobs = new ArrayDeque<>();
      
      int nbad = 0;
      int ngood = 0;
      
      for (int i = 0, j = 0; i < R; i++) {
          while (i < R && cnt[i] == 0) i++;
          
          if (i == R) break;
          
          j = i;
          while (j < R && cnt[j] != 0) j++;
          
          //System.out.println("new job " + i + " " + (j-1));
          Job job = new Job(i, j - 1);
          // if length == 2, or 3,  can not solve it by itseft
          if (j - i == 2 ||  j - i == 3) {
             jobs.addLast(job);
             nbad++;
          }
          else {
             jobs.addFirst(job);
             ngood++;
          }
          
          i = j;
      }
      //System.out.println("good = " + ngood + ", bad == " + nbad);
      if (nbad == 1 && ngood == 0) {
          return "No answer";
      }
      
      StringBuilder sb = new StringBuilder();
      while (!jobs.isEmpty()) {
          Job cur = jobs.removeFirst();
          if (cur.good()) {
              sb.append(expand(cur, cnt));
          }else if (sb.length() == 0) {
              Job next = jobs.removeFirst();
              // combine cur and next
              sb.append(combine(cur, next, cnt));              
          }else {
              StringBuilder tmp = sb;
              sb = new StringBuilder();
              
              String[] parts = chunk(cur, cnt);
              sb.append(parts[0]);
              sb.append(tmp);
              sb.append(parts[1]);
          }
      }
      return sb.toString();
  }
  
  private String[] chunk(Job cur, int[] cnt)
  {
      String[] p = new String[2];
      if (cur.s + 1 == cur.e) {
                  p[0] = rep(cur.s, cnt[cur.s]);                 
                  p[1] = rep(cur.e, cnt[cur.e]);                 
              }else {
                  p[0] = rep(cur.s, cnt[cur.s]) + rep(cur.e, cnt[cur.e]);                  
                  p[1] = rep(cur.s + 1, cnt[cur.s + 1]);
              }     
      return p;
  }
  
  private String combine(Job cur, Job next, int[] cnt) {      
      String[] p = chunk(cur, cnt);
      String[] q = chunk(next, cnt);
      return p[0] + q[0] + p[1] + q[1];
  }
  
  private String expand(Job cur, int[] cnt) {
      int jobLen = cur.e - cur.s + 1;
      StringBuilder sb = new StringBuilder();
      if (jobLen == 4) {
          // bdac
          // 1302
          sb.append(rep(cur.s + 1, cnt[cur.s + 1]));
          sb.append(rep(cur.e, cnt[cur.e]));
          sb.append(rep(cur.s, cnt[cur.s]));
          sb.append(rep(cur.s + 2, cnt[cur.s + 2]));
      }else {
          // 01234
          // 0 3 1 4 2
          int sj = (jobLen + 1) / 2;
          for (int i = 0, j = sj; i < sj; i++, j++) {
              sb.append(rep(cur.s + i, cnt[cur.s + i]));
              if (j < jobLen)
                sb.append(rep(cur.s + j, cnt[cur.s + j]));
          }
          // 0 3 1 4 2 5
      }
      return sb.toString();
  }
  
  private String rep(int ai, int c) {
      char a = (char)('a' + ai);
      StringBuilder sb = new StringBuilder();
      for (int i = 0; i < c; i++) sb.append(a);
      
      return sb.toString();
  }
  
  class Job {
      int s;
      int e;
      public Job(int si, int ei) {
        s = si;
        e = ei;
      }
      
      public boolean good() {
          return s == e || e - s > 2;
      }
  }
 
 
  private int mod_add(int a, int b) {
      int v = a + b;
      if (v >= MOD) v -= MOD;
      return v;
  }
  
  
  private long overlap(int x1, int y1, int x2, int y2, int x3, int y3, int x4, int y4) {
      if (x1 > x3) return overlap(x3, y3, x4, y4, x1, y1, x2, y2);
      
      if (x3 > x2 || y4 < y1 || y3 > y2) return 0L;
      
      //(x3, ?, x2, ?)
      int yL = Math.max(y1, y3);
      int yH = Math.min(y2, y4); 
      int xH = Math.min(x2, x4);
      
      return f(x3, yL, xH, yH);
  }
  //return #black cells in rectangle
  private long f(int x1, int y1, int x2, int y2) {
      long dx = 1L + x2 - x1;
      long dy = 1L + y2 - y1;
      if (dx % 2 == 0 || dy % 2 == 0 || (x1 + y1) % 2 == 0) 
          return 1L * dx * dy / 2;
      return 1L * dx * dy / 2 + 1;
  }
  
  private int dist(int x, int y, int xx, int yy) {
      return abs(x - xx) + abs(y - yy);
  }
  
  private boolean less(int x, int y, int xx, int yy) {
      return x < xx || y > yy;
  }
  
  private int mul(int x, int y) {
      return (int)(1L * x * y % MOD);
  }
  
  private int add(int x, int y) {
      return (x + y) % MOD;
  }
  
 
  
  private int nBit1(int v) {
      int v0 = v;
      int c = 0;
      while (v != 0) {
          ++c;
          v = v & (v - 1);
      }
      return c;
  }
  
  private long abs(long v) {
      return v > 0 ? v : -v;
  }
  
  private int abs(int v) {
      return v > 0 ? v : -v;
  }
  
  private int common(int v) {
      int c = 0;
      while (v != 1) {
          v = (v >>> 1);
          ++c;
      }
      
      return c;
  }
  
  private void reverse(char[] a, int i, int j) {
      while (i < j) {
          swap(a, i++, j--);
      }
  }
  
  private void swap(char[] a, int i, int j) {
      char t = a[i];
      a[i] = a[j];
      a[j] = t;
  }
  
  private int gcd(int x, int y) {
      if (y == 0) return x;
      return gcd(y, x % y);
  }
  private long gcd(long x, long y) {
      if (y == 0) return x;
      return gcd(y, x % y);
  }
  private int max(int a, int b) {
      return a >  b ? a : b;
  }
  
  private long max(long a, long b) {
      return a >  b ? a : b;
  }
  
  private int min(int a, int b) {
      return a >  b ? b : a;
  }
  
  private long min(long a, long b) {
      return a >  b ? b : a;
  }
  
  static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;
 
        public FastReader(BufferedReader in)
        {            
            br = in;
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    String line = br.readLine();
                    if (line == null || line.length() == 0) return "";
                    st = new StringTokenizer(line);
                }
                catch (IOException  e)
                {
                    return "";
                    //e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt()
        {
            return Integer.parseInt(next());
        }
 
        long nextLong()
        {
            return Long.parseLong(next());
        }
 
        double nextDouble()
        {
            return Double.parseDouble(next());
        }
 
        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                return null;
                //e.printStackTrace();
            }
            return str;
        }
    }
}