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
#	!/bin/env python3
#	coding: UTF-8


#	✪ H4WK3yE乡
#	Mohd. Farhan Tahir
#	Indian Institute Of Information Technology and Management,Gwalior

#	Question Link
#	https://codeforces.com/problemset/problem/1051/C
#

# ///==========Libraries, Constants and Functions=============///


import sys

inf = float("inf")
mod = 1000000007


def get_array(): return list(map(int, sys.stdin.readline().split()))


def get_ints(): return map(int, sys.stdin.readline().split())


def input(): return sys.stdin.readline()

# ///==========MAIN=============///


def main():
    n = int(input())
    arr = get_array()
    d = {}
    for i in arr:
        d[i] = d.get(i, 0)+1
    count = 0
    check = 0
    for i in d:
        if d[i] == 1:
            count += 1
        if d[i] > 2:
            check = 1

    if count % 2 == 0:
        ans = ['A']*n
        flag = 0
        for i in range(n):
            if d[arr[i]] == 1:
                if flag == 1:
                    ans[i] = 'B'
                flag = 1-flag
        print('YES')
        print(*ans, sep='')
        return

    if count % 2 == 1 and check == 0:
        print('NO')
        return

    flag = 0
    check = 0
    ans = ['A']*n
    for i in range(n):
        if d[arr[i]] == 1:
            if flag == 1:
                ans[i] = 'B'
            flag = 1-flag
        if check == 0 and d[arr[i]] > 2:
            check = 1
            ans[i] = 'B'
    print('YES')
    print(*ans, sep='')


if __name__ == "__main__":
    main()
