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
# IMPORTS---------------------------------------------------------------------#
from __future__ import division, print_function

#from atexit import register
#from io import BytesIO
#from decimal import Decimal, getcontext
from collections import Counter
from itertools import ifilter, imap, izip
from sys import stdin, stdout


# PYTHON3---------------------------------------------------------------------#
range = xrange
filter = ifilter
map = imap
zip = izip


# SETTINGS--------------------------------------------------------------------#
#getcontext().prec = 100
#setrecursionlimit(100000)


# CONSTANTS-------------------------------------------------------------------#
MOD = 1000000007
INF = float('+inf')


# FASTIO----------------------------------------------------------------------#
#stdout = BytesIO()
#register(lambda: __stdout__.write(stdout.getvalue()))
#stdin = BytesIO(stdin.read())


# IO--------------------------------------------------------------------------#
input = lambda: stdin.readline().rstrip()
print = lambda *args: stdout.write(' '.join(str(x) for x in args) + '\n')
#flush = stdout.flush()


# MAIN------------------------------------------------------------------------#
def main():
    n = int(input())
    s = list(map(int, input().split(' ')))
    cs = Counter(s)
    nice = {i[0] for i in cs.items() if i[1] == 1}
    if len(nice) % 2 == 1:
        extra = {i[0] for i in cs.items() if i[1] > 2}
        if len(extra) > 0:
            print('YES')
            flag = True
            extra_flag = True
            out = [None] * n
            for i in range(n):
                if s[i] in nice:
                    if flag:
                        out[i] = 'A'
                        flag = False
                    else:
                        out[i] = 'B'
                        flag = True
                else:
                    if (s[i] in extra) and extra_flag:
                        out[i] = 'B'
                        extra_flag = False
                    else:
                        out[i] = 'A'
            print(''.join(out))
        else:
            print('NO')
    else:
        print('YES')
        flag = False
        out = [None] * n
        for i in range(n):
            if s[i] in nice:
                if flag:
                    out[i] = 'A'
                    flag = False
                else:
                    out[i] = 'B'
                    flag = True
            else:
                out[i] = 'A'
        print(''.join(out))
            



if __name__ == '__main__':
    main()
