Problem: Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice numbers 2 and 4.

Vasya wants to split multiset s into two multisets a and b (one of which may be empty) in such a way that the quantity of nice numbers in multiset a would be the same as the quantity of nice numbers in multiset b (the quantity of numbers to appear exactly once in multiset a and the quantity of numbers to appear exactly once in multiset b).

Input

The first line contains a single integer n~(2 ≤ n ≤ 100).

The second line contains n integers s_1, s_2, ... s_n~(1 ≤ s_i ≤ 100) — the multiset s.

Output

If there exists no split of s to satisfy the given requirements, then print "NO" in the first line.

Otherwise print "YES" in the first line.

The second line should contain a string, consisting of n characters. i-th character should be equal to 'A' if the i-th element of multiset s goes to multiset a and 'B' if if the i-th element of multiset s goes to multiset b. Elements are numbered from 1 to n in the order they are given in the input.

If there exist multiple solutions, then print any of them.

Examples

Input

4
3 5 7 1


Output

YES
BABA


Input

3
3 5 1


Output

NO

Solution (in JAVA):

Solution:
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */


import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
import java.lang.*;
import java.util.Arrays;
import java.util.*; 


/**
 *
 * @author Omar
 */
public class Main
{
    

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) 
    {
                    Scanner scr=new Scanner(System.in);
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out,scr);
        out.close();
        // TODO code application logic here
    }
    
    
    static class TaskB 
    {
        
       
        public void solve(int testNumber, InputReader in, PrintWriter out,Scanner scr) 
        {
           int n;
           n=in.nextInt();
           int[] a= new int[n];
           int[] map=new int[101];
           for(int i=0;i<n;i++)
           {
               a[i]=in.nextInt();
               map[a[i]]++;
           }    
           int single=0,three=0;
           for (int i=0;i<101;i++)
           {
               if (map[i]==1)
                   single++;
               
               if (map[i]>2)
                   three++;
           }
           if (single==0)
           {
               out.println("YES");
               for (int i=0;i<n;i++)
                   out.printf("%s","A");
           }
           else if (single%2==1)
           {
               if(three==0)
                   out.println("NO");
               else
               {
                    out.println("YES");
                    int k=single/2;
                    boolean t=true;
                    for (int i=0;i<n;i++)
                    {
                        if (k>0 && map[a[i]]==1 )
                        {
                         out.printf("%s","B");
                         k--;
                        }
                        else if(t && map[a[i]]>2)
                        {
                         out.printf("%s","B");
                         t=false;
                        }
                        else
                          out.printf("%s","A");  
                    }
               }
           }
           else
           {
               out.println("YES");
               int k=single/2;
               for (int i=0;i<n;i++)
               {
                   if (k>0 && map[a[i]]==1 )
                   {
                    out.printf("%s","B");
                    k--;
                   }
                   else
                     out.printf("%s","A");  
               }
               
           }
               
    
        }
        
  }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
    
    
    
    
}