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

public class C {
/*
 * 
6
3 5 7 1 2 2
8
3 5 1 2 2 7 7 7
10
1 1 1 1 1 1 1 1 1 1

 */
	public static void main(String[] args) {
		JS in = new JS();
		PrintWriter out = new PrintWriter(System.out);
		
		int N = in.nextInt();
		int ar[] = new int[N];
		int freq[] = new int[101];
		for(int i = 0; i < N; i++) {
			ar[i] = in.nextInt();
			freq[ar[i]]++;
		}
		int ones = 0;
		int twos = 0;
		int other = 0;
		for(int i = 0; i < 101; i++) {
			if(freq[i] == 1)ones++;
			else if(freq[i] == 2)twos++;
			else if(freq[i] > 2)other++;
		}
		//System.out.println(ones+" "+twos+" "+other);
		if(ones%2 == 1 && (other) == 0) {
			out.println("NO");
		}
		else if(ones%2 == 0) {
			boolean oneToA = true;
			boolean inA[] = new boolean[N];
			for(int i = 0; i < N; i++) {
				if(freq[ar[i]] == 1) {
					if(oneToA) inA[i]=true;
					oneToA = !oneToA;
				}
			}
			out.println("YES");
			for(int i = 0; i < N; i++) out.print(inA[i]?'A':'B');
			out.println();
		}
		else {
			boolean oneToA = false;
			boolean inA[] = new boolean[N];
			for(int i = 0; i < N; i++) {
				if(freq[ar[i]] == 1) {
					if(oneToA) inA[i]=true;
					oneToA = !oneToA;
				}
			}
			for(int i = 0; i < N; i++) {
				if(freq[ar[i]] > 2) {
					inA[i]=true;
					break;
				}
			}
			out.println("YES");

			for(int i = 0; i < N; i++) out.print(inA[i]?'A':'B');
			out.println();
		}
		
		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;
			}
		}
	}
	
}