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

# -*- coding: utf-8 -*-
# @Date    : 2018-09-22 16:53:43
# @Author  : raj lath (oorja.halt@gmail.com)
# @Link    : http://codeforces.com/contest/1051/problem/C
# @Version : 1.0.0

from sys import stdin

max_val=int(10e12)
min_val=int(-10e12)

def read_int()     : return int(stdin.readline())
def read_ints()    : return [int(x) for x in stdin.readline().split()]
def read_str()     : return input()
def read_strs()    : return [x for x in stdin.readline().split()]

'''
Examples
inputCopy
4
3 5 7 1
outputCopy
YES
BABA
inputCopy
3
3 5 1
outputCopy
NO
'''
from collections import Counter
lens = read_int()
arrs = read_ints()
3
ans  = ["A"] * lens
arrc = Counter(arrs)

a =  sum([1 for x in arrs if arrc[x] == 1])
b = 0
for i in range(lens):
    if arrc[arrs[i]] == 1 and a > (b+1):
        ans[i] = 'B'
        a -= 1
        b += 1

for i in range(lens):
    if arrc[arrs[i]] > 2 and a == (b+1):
        ans[i] = "B"
        b += 1
        break
if a == b:
    print("YES")
    print(''.join(ans))
else:
    print("NO")













