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;
long long N = 200000;
vector<bool> visited(N + 1, false);
bool isprime(long long x) {
  for (long long i = 2; i <= sqrt(x); i++) {
    if (x % i == 0) return false;
  }
  return true;
}
void findfact(long long x, map<long long, vector<long long>>& m) {
  for (long long i = 3; i * i <= x; i += 2) {
    if (x % i == 0) {
      if (i == x / i)
        m[x].push_back(i);
      else {
        m[x].push_back(i);
        m[x].push_back(x / i);
      }
      break;
    }
  }
  return;
}
struct cmp {
  bool operator()(const pair<int, int>& a, const pair<int, int>& b) {
    if (a.first > b.first)
      return false;
    else if (a.first < b.first)
      return true;
    if (a.second < b.second) return false;
    return true;
  }
};
bool isPalindrome(string t) {
  long long st = 0;
  long long end = t.size() - 1;
  while (st <= end) {
    if (t[st] != t[end]) return false;
    st++;
    end--;
  }
  return true;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
bool pow2(long long x) { return x && (!(x & (x - 1))); }
unsigned long long factorial(unsigned long long n) {
  return (n == 1 || n == 0) ? 1 : n * factorial(n - 1);
}
unsigned long long binomialCoeff(unsigned long long n, unsigned long long k) {
  unsigned long long res = 1;
  if (k > n - k) k = n - k;
  for (unsigned long long i = 0; i < k; ++i) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
vector<long long> hp;
void primeFactors(long long n) {
  while (n % 2 == 0) {
    hp.push_back(2);
    n = n / 2;
  }
  for (int i = 3; i <= sqrt(n); i = i + 2) {
    while (n % i == 0) {
      hp.push_back(i);
      n = n / i;
    }
  }
  if (n > 2) hp.push_back(n);
}
long long minFlipsMonoIncr(string S) {
  int flip = 0;
  int ones = 0;
  bool flag = false;
  for (int i = 0; i < S.size(); i++) {
    if (S[i] - '0' == 1) flag = true;
    if (flag && S[i] - '0' == 0)
      flip++;
    else if (S[i] == '1')
      ones++;
    if (flip > ones) flip = ones;
  }
  return flip;
}
void dfs() {}
int main() {
  ios_base::sync_with_stdio(0);
  long long n;
  cin >> n;
  vector<long long> arr(n);
  vector<long long> cnt(101, 0);
  map<long long, long long> m;
  for (long long i = 0; i < n; i++) cin >> arr[i], cnt[arr[i]]++;
  long long freq1 = 0;
  long long freq3 = 0;
  for (long long i = 1; i < 101; i++) {
    if (cnt[i] == 2) continue;
    if (cnt[i] >= 3) freq3++;
    if (cnt[i] == 1) freq1++;
  }
  if (freq1 % 2 == 0) {
    cout << "YES"
         << "\n";
    long long count = freq1 / 2;
    for (long long i = 0; i < n; i++) {
      if (cnt[arr[i]] >= 2)
        cout << 'A';
      else {
        if (count > 0)
          cout << 'A';
        else
          cout << 'B';
        count--;
      }
    }
  } else {
    if (freq3 == 0) {
      cout << "NO"
           << "\n";
      return 0;
    } else {
      long long k = 1;
      cout << "YES"
           << "\n";
      long long x;
      bool flag = false;
      for (long long i = 0; i < n; i++) {
        if (cnt[arr[i]] == 2 || flag && cnt[arr[i]] >= 3) {
          cout << 'A';
        }
        if (cnt[arr[i]] >= 3 && !flag) {
          cout << 'B';
          flag = true;
          continue;
        } else if (cnt[arr[i]] == 1) {
          if (k % 2 == 1)
            cout << 'A';
          else
            cout << 'B';
          k++;
        }
      }
    }
  }
}