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
#include <bits/stdc++.h>
using namespace std;
int main() {
  cin.tie(0);
  cout.tie(0);
  int n, i, j, a[102], buc[102] = {0};
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    buc[a[i]]++;
  }
  int ones = 0, mx = -1;
  for (i = 1; i <= 100; i++) {
    if (buc[i] == 1) {
      ones++;
    }
    mx = max(mx, buc[i]);
  }
  if (!(ones % 2)) {
    cout << "YES" << endl;
    int cnt = 0;
    for (i = 0; i < n; i++) {
      if (buc[a[i]] > 1) {
        cout << "A";
      } else {
        if (cnt == ones / 2) {
          cout << "A";
        } else {
          cout << "B";
          cnt++;
        }
      }
    }
  } else {
    if (mx <= 2) {
      cout << "NO";
    } else {
      cout << "YES" << endl;
      int cnt = 0, flag = 0;
      for (i = 0; i < n; i++) {
        if (buc[a[i]] > 2 && !flag) {
          cout << "B";
          flag = 1;
        } else if (buc[a[i]] > 1 && flag) {
          cout << "A";
        } else if (buc[a[i]] > 1 && !flag) {
          cout << "B";
        } else {
          if (cnt == ones / 2) {
            cout << "A";
          } else {
            cout << "B";
            cnt++;
          }
        }
      }
    }
  }
  cout << endl;
  return 0;
}
