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 JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author masterbios
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int a[] = new int[n];
            for (int i = 0; i < n; i++) a[i] = in.nextInt();
            int occur[] = new int[101];
            for (int i = 0; i < n; i++) occur[a[i]]++;
            int single = 0;
            int gtwo = 0;
            for (int i = 0; i < n; i++) {
                if (occur[a[i]] == 1) single++;
                if (occur[a[i]] > 2) gtwo++;
            }
            if (single % 2 != 0 && gtwo == 0) {
                out.println("NO");
            } else {
                StringBuilder sb = new StringBuilder();
                if (single % 2 == 0) {
                    int turn = 1;
                    for (int i = 0; i < n; i++) {
                        if (occur[a[i]] == 1 && turn % 2 == 0) {
                            a[i] = 999;
                            turn++;
                        } else if (occur[a[i]] == 1 && turn % 2 != 0) {
                            a[i] = 1000;
                            turn++;
                        } else {
                            a[i] = 999;
                        }
                    }
                } else {
                    int turn = 1;
                    int counta = 0;
                    int countb = 0;
                    for (int i = 0; i < n; i++) {
                        if (occur[a[i]] == 1 && turn % 2 == 0) {
                            a[i] = 999;
                            counta++;
                            turn++;
                        } else if (occur[a[i]] == 1 && turn % 2 != 0) {
                            a[i] = 1000;
                            countb++;
                            turn++;
                        }
                    }
                    if (counta == countb && counta == 0) {
                        int count = 0;
                        for (int i = 0; i < n; i++) {
                            if (a[i] <= 100) {
                                if (occur[a[i]] > 2) {
                                    int element = a[i];
                                    a[i] = 999;
                                    count++;
                                    for (int j = i + 1; j < n; j++) {
                                        if (a[j] == element) {
                                            a[j] = 1000;
                                        }
                                    }
                                    if (count == 2) break;
                                }
                            }
                        }
                        for (int i = 0; i < n; i++) {
                            if (a[i] <= 100) a[i] = 999;
                        }
                    } else if (counta > countb) {
                        for (int i = 0; i < n; i++) {
                            if (a[i] <= 100) {
                                if (occur[a[i]] > 2) {
                                    int element = a[i];
                                    a[i] = 1000;
                                    for (int j = i + 1; j < n; j++) {
                                        if (a[j] == element) {
                                            a[j] = 999;
                                        }
                                    }
                                    break;
                                }
                            }
                        }
                        for (int i = 0; i < n; i++) {
                            if (a[i] <= 100) a[i] = 999;
                        }
                    } else {
                        for (int i = 0; i < n; i++) {
                            if (a[i] <= 100) {
                                if (occur[a[i]] > 2) {
                                    int element = a[i];
                                    a[i] = 999;
                                    for (int j = i + 1; j < n; j++) {
                                        if (a[j] == element) {
                                            a[j] = 1000;
                                        }
                                    }
                                    break;
                                }
                            }
                        }
                        for (int i = 0; i < n; i++) {
                            if (a[i] <= 100) a[i] = 999;
                        }
                    }

                }
                for (int i = 0; i < n; i++) {
                    if (a[i] == 999) sb.append('A');
                    else sb.append('B');
                }
                out.println("YES\n" + sb.toString());
            }
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreElements()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}