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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Preet
 */
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();
            HashMap<Integer, Integer> map = new HashMap<>();
            int a[] = new int[n];

            for (int i = 0; i < n; i++) {
                int x = in.nextInt();
                a[i] = x;
                if (!map.containsKey(x)) map.put(x, 1);
                else map.put(x, map.get(x) + 1);
            }

            int count = 0;
            int val = -1;

            for (Integer i : map.keySet()) {
                if (map.get(i) == 1) count++;
                if (map.get(i) > 2) val = i;
            }

            if (count % 2 == 0) {
                out.println("YES");
                int flag = 0;
                StringBuilder sb = new StringBuilder();

                for (int i = 0; i < n; i++) {
                    if (map.get(a[i]) == 1) {
                        if (flag == 0) sb.append("A");
                        else sb.append("B");
                        flag ^= 1;
                    } else {
                        sb.append("A");
                    }
                }

                out.println(sb.toString());
            } else {
                if (val != -1) {
                    out.println("YES");
                    int flag = 0;
                    StringBuilder sb = new StringBuilder();
                    boolean done = false;
                    int kayo = -1;

                    for (int i = 0; i < n; i++) {
                        if (map.get(a[i]) == 1) {
                            if (flag == 0) sb.append("A");
                            else sb.append("B");
                            flag ^= 1;
                        } else {
                            if (a[i] == val) {
                                if (!done) {
                                    if (flag == 0) {
                                        sb.append("A");
                                        kayo = 0;
                                    } else {
                                        sb.append("B");
                                        kayo = 1;
                                    }
                                    flag ^= 1;
                                    done = true;
                                } else {
                                    if (kayo == 0) sb.append("B");
                                    else sb.append("A");
                                }
                            } else {
                                sb.append("A");
                            }
                        }
                    }

                    out.println(sb.toString());
                } else {
                    out.println("NO");
                }
            }
        }

    }

    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 nextInt() {
            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 c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

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

        }

    }
}