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 cnt[11010];
int A[11010];
int where[11010];
int main() {
  ios_base::sync_with_stdio(false);
  int N;
  cin >> N;
  for (int i = 1; i <= N; i++) {
    cin >> A[i];
    cnt[A[i]]++;
  }
  int howMany = 0;
  for (int i = 1; i <= 100; i++) {
    if (cnt[i] == 1) {
      howMany++;
    }
  }
  if (howMany % 2) {
    if (howMany == N) {
      cout << "NO" << endl;
    } else {
      bool is = false;
      int which;
      for (int i = 1; i <= 100; i++) {
        if (cnt[i] >= 3) {
          is = true;
          which = i;
          break;
        }
      }
      if (is) {
        cout << "YES" << endl;
        int val = 0;
        bool okay = false;
        for (int i = 1; i <= 100; i++) {
          if (cnt[i] == 0) continue;
          if (cnt[i] == 1) {
            if (val < (howMany / 2 + 1)) {
              val++;
              where[i] = 1;
            } else {
              where[i] = 2;
            }
          } else {
            if (i == which) {
              where[i] = 2;
            } else {
              where[i] = 1;
            }
          }
        }
        for (int i = 1; i <= N; i++) {
          if (cnt[A[i]] and A[i] != which) {
            if (where[A[i]]) {
              if (where[A[i]] == 1) {
                cout << "A";
              } else {
                cout << "B";
              }
            }
          } else if (cnt[A[i]]) {
            if (okay) {
              cout << "A";
            } else {
              cout << "B";
              okay = true;
            }
          }
        }
        cout << endl;
      } else {
        cout << "NO" << endl;
      }
    }
  } else {
    cout << "YES" << endl;
    int val = 0;
    for (int i = 1; i <= 100; i++) {
      if (cnt[i] == 1) {
        if (val < howMany / 2) {
          val++;
          where[i] = 1;
        } else {
          where[i] = 2;
        }
      }
    }
    for (int i = 1; i <= N; i++) {
      if (cnt[A[i]]) {
        if (where[A[i]]) {
          if (where[A[i]] == 1) {
            cout << "A";
          } else {
            cout << "B";
          }
        } else {
          cout << "A";
        }
      }
    }
    cout << endl;
  }
  return 0;
}
