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 s[51][51];
long long n, m;
long long viss[51][51] = {};
void dfss(long long x, long long y) {
  if (viss[x][y] == 1) return;
  viss[x][y] = 1;
  if (y + 1 <= m - 1 and (s[x][y + 1] == 1)) dfss(x, y + 1);
  if (x + 1 <= n - 1 and (s[x + 1][y] == 1)) dfss(x + 1, y);
  if (y - 1 >= 0 and (s[x][y - 1] == 1)) dfss(x, y - 1);
  if (x - 1 >= 0 and (s[x - 1][y] == 1)) dfss(x - 1, y);
  if (y - 1 >= 0 and x - 1 >= 0 and (s[x - 1][y - 1] == 1)) dfss(x - 1, y - 1);
  if (x + 1 <= n - 1 and y + 1 <= m - 1 and (s[x + 1][y + 1] == 1))
    dfss(x + 1, y + 1);
  if (x + 1 <= n - 1 and y - 1 >= 0 and (s[x + 1][y - 1] == 1))
    dfss(x + 1, y - 1);
  if (x - 1 >= 0 and y + 1 <= m - 1 and (s[x - 1][y + 1] == 1))
    dfss(x - 1, y + 1);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  long long a[n];
  map<long long, long long> ux;
  for (long long i = 0; i <= n - 1; i++) {
    cin >> a[i];
    ux[a[i]]++;
  }
  vector<long long> multi;
  vector<long long> ans1;
  char uxx[n];
  for (long long i = 0; i <= n - 1; i++) {
    uxx[i] = '.';
  }
  for (auto u : ux) {
    if (u.second > 2) {
      multi.push_back(u.first);
    }
  }
  for (int i = 0; i < n; i++) {
    if (ux[a[i]] == 1) {
      ans1.push_back(i);
    }
  }
  set<long long> st;
  for (auto u : ux) {
    if (u.second == 1) {
      st.insert(u.first);
    }
  }
  if (st.size() % 2 == 0) {
    cout << "YES"
         << "\n";
    long long sz = ans1.size();
    for (long long i = 0; i <= sz / 2 - 1; i++) {
      uxx[ans1[i]] = 'A';
    }
    for (long long i = sz / 2; i <= sz - 1; i++) {
      uxx[ans1[i]] = 'B';
    }
    for (long long i = 0; i <= n - 1; i++) {
      if (uxx[i] == '.') {
        uxx[i] = 'A';
      }
    }
    for (long long i = 0; i <= n - 1; i++) {
      cout << uxx[i];
    }
  } else {
    if (multi.size() >= 1) {
      cout << "YES"
           << "\n";
      long long sz = ans1.size();
      for (long long i = 0; i <= sz / 2 - 1; i++) {
        uxx[ans1[i]] = 'A';
      }
      for (long long i = sz / 2; i <= sz - 1; i++) {
        uxx[ans1[i]] = 'B';
      }
      for (long long i = 0; i <= n - 1; i++) {
        if (a[i] == multi[0]) {
          uxx[i] = 'A';
          break;
        }
      }
      for (long long i = 0; i <= n - 1; i++) {
        if (uxx[i] == '.') {
          uxx[i] = 'B';
        }
      }
      for (long long i = 0; i <= n - 1; i++) {
        cout << uxx[i];
      }
    } else {
      cout << "NO"
           << "\n";
    }
  }
}
