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 b[105];
int vis[105];
int main() {
  int n;
  scanf("%d", &n);
  int a[105];
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    b[a[i]]++;
  }
  int ans1 = 0;
  int ans2 = 0;
  int jo = 1;
  int mm = 0;
  for (int i = 0; i < n; i++) {
    int x = a[i];
    if (b[x] > 0) {
      if (b[x] <= 2) {
        if (jo == 1) {
          vis[i] = 1;
          jo = -1;
          ans1++;
          if (b[x] == 2) {
            for (int j = i + 1; j <= n; j++) {
              if (a[i] == x) {
                vis[i] = -1;
                jo = 1;
                ans2++;
                break;
              }
            }
          }
        } else {
          vis[i] = -1;
          jo = 1;
          ans2++;
          if (b[x] == 2) {
            for (int j = i + 1; j <= n; j++) {
              if (a[i] == x) {
                vis[i] = 1;
                jo = -1;
                ans1++;
                break;
              }
            }
          }
        }
        b[x] = 0;
      } else {
        mm++;
      }
    }
  }
  if (ans1 == ans2) {
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) {
      if (vis[i] == 1) {
        cout << "B";
      } else {
        cout << "A";
      }
    }
  } else {
    if (mm == 0) {
      cout << "NO" << endl;
    } else {
      if (ans1 > ans2) {
        for (int i = 0; i < n; i++) {
          if (b[a[i]] > 2) {
            vis[i] = -1;
            break;
          }
        }
        cout << "YES" << endl;
        for (int i = 0; i < n; i++) {
          if (vis[i] == 1 || vis[i] == 0) {
            cout << "B";
          } else {
            cout << "A";
          }
        }
      } else {
        for (int i = 0; i < n; i++) {
          if (b[a[i]] > 2) {
            vis[i] = 1;
            break;
          }
        }
        cout << "YES" << endl;
        for (int i = 0; i < n; i++) {
          if (vis[i] == 1) {
            cout << "B";
          } else {
            cout << "A";
          }
        }
      }
    }
  }
  return 0;
}
