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.HashSet;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
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.ni();
            int[] s = new int[101];
            // int t1 = 0, t2 = 0;
            int[] ar = new int[n];
            for (int i = 0; i < n; ++i) {
                ar[i] = in.ni();
                s[ar[i]]++;
            }
            HashSet<Integer> a = new HashSet<>();
            HashSet<Integer> b = new HashSet<>();
            int remain = 0;
            int ca = 0, cb = 0;
            for (int i = 0; i < 101; ++i) {
                if (s[i] == 1) {
                    if (ca >= cb) {
                        cb++;
                        b.add(i);
                    } else {
                        ca++;
                        a.add(i);
                    }
                }
                if (s[i] == 2) a.add(i);
                if (s[i] > 2) remain++;
            }
            if (ca == cb) {
                out.println("YES");
                for (int i = 0; i < n; ++i) {
                    if (a.contains(ar[i])) out.print("A");
                    else if (b.contains(ar[i])) out.print("B");
                    else out.print("B");
                }
                return;
            } else if (ca < cb) {
                boolean f = false;
                if (remain == 0) {
                    out.println("NO");
                    return;
                }
                out.println("YES");
                for (int i = 0; i < n; ++i) {
                    if (a.contains(ar[i])) out.print("A");
                    else if (b.contains(ar[i])) out.print("B");
                    else {
                        if (!f) {
                            f = true;
                            out.print("A");
                        } else out.print("B");
                    }
                }
            } else {
                boolean f = false;
                if (remain == 0) {
                    out.println("NO");
                    return;
                }
                out.println("YES");
                for (int i = 0; i < n; ++i) {
                    if (a.contains(ar[i])) out.print("A");
                    else if (b.contains(ar[i])) out.print("B");
                    else {
                        if (!f) {
                            f = true;
                            out.print("B");
                        } else out.print("A");
                    }
                }
            }
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int ni() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}