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
"""
Code of Ayush Tiwari
Codeforces: servermonk
Codechef: ayush572000

"""
import sys
input = sys.stdin.buffer.readline
# from collections import Counter
def solution():
    n=int(input())
    l=list(map(int,input().split()))
    d=[0]*101
    for i in l:
        d[i]+=1
    cnt=0
    ind=0
    x=[]
    flag=0
    s=''
    for i in range(101):
        if d[i]==1:
            cnt+=1
            x.append(i)
        if d[i]>2:
            ind=i
    # print(ind)
    if cnt%2!=0 and ind==0:
        print('NO')
    else:
        print('YES')
        if cnt%2==0:
            for i in range(n):
                if d[l[i]]==1:
                    if flag==0:
                        s+='A'
                        flag=1
                    else:
                        s+='B'
                        flag=0
                else:
                    s+='A'
        else:
            flag=0

            fa=0
            fb=0
            f=0
            for i in range(n):
                if d[l[i]]==1:
                    # print(l[i])
                    if flag==0:
                        s+='A'
                        flag=1
                    else:
                        s+='B'
                        flag=0
                elif l[i]==ind and f==0:
                    if flag==0:
                        s+='A'
                        fa=1
                        flag=1
                    else:
                        s+='B'
                        fb=1
                        flag=0
                    f=1
                else:
                    if l[i]==ind:
                        if fa==1:
                            s+='B'
                        else:
                            s+='A'
                    else:   
                        s+='A'
    print(s)
solution()