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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n, s[105], vis[105], Num[105], num, num1;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &s[i]);
    Num[s[i]]++;
  }
  for (int i = 1; i <= 100; i++) {
    if (Num[i] == 1) num1++;
    if (Num[i] >= 3) num++;
  }
  if (num == 0 && num1 % 2 == 1)
    printf("NO\n");
  else {
    printf("YES\n");
    if (num1 % 2 == 0) {
      int now = 0;
      for (int i = 1; i <= n; i++) {
        if (Num[s[i]] == 1) {
          if (now)
            printf("A"), now ^= 1;
          else
            printf("B"), now ^= 1;
        } else
          printf("A");
      }
    } else {
      int flag = 0;
      int now = 0;
      for (int i = 1; i <= n; i++) {
        if (Num[s[i]] == 1) {
          if (now)
            printf("A"), now ^= 1;
          else
            printf("B"), now ^= 1;
        } else {
          if (!flag && Num[s[i]] >= 3) {
            flag = 1;
            printf("A");
          } else
            printf("B");
        }
      }
    }
  }
}