Problem: Valera has 2·n cubes, each cube contains an integer from 10 to 99. He arbitrarily chooses n cubes and puts them in the first heap. The remaining cubes form the second heap. 

Valera decided to play with cubes. During the game he takes a cube from the first heap and writes down the number it has. Then he takes a cube from the second heap and write out its two digits near two digits he had written (to the right of them). In the end he obtained a single fourdigit integer — the first two digits of it is written on the cube from the first heap, and the second two digits of it is written on the second cube from the second heap.

Valera knows arithmetic very well. So, he can easily count the number of distinct fourdigit numbers he can get in the game. The other question is: how to split cubes into two heaps so that this number (the number of distinct fourdigit integers Valera can get) will be as large as possible?

Input

The first line contains integer n (1 ≤ n ≤ 100). The second line contains 2·n space-separated integers ai (10 ≤ ai ≤ 99), denoting the numbers on the cubes.

Output

In the first line print a single number — the maximum possible number of distinct four-digit numbers Valera can obtain. In the second line print 2·n numbers bi (1 ≤ bi ≤ 2). The numbers mean: the i-th cube belongs to the bi-th heap in your division.

If there are multiple optimal ways to split the cubes into the heaps, print any of them.

Examples

Input

1
10 99


Output

1
2 1 


Input

2
13 24 13 45


Output

4
1 2 2 1 

Note

In the first test case Valera can put the first cube in the first heap, and second cube — in second heap. In this case he obtain number 1099. If he put the second cube in the first heap, and the first cube in the second heap, then he can obtain number 9910. In both cases the maximum number of distinct integers is equal to one.

In the second test case Valera can obtain numbers 1313, 1345, 2413, 2445. Note, that if he put the first and the third cubes in the first heap, he can obtain only two numbers 1324 and 1345.

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class B {
    public static void main(String[] args) throws Exception {
        new B();
    }

    StreamTokenizer in = new StreamTokenizer(System.in);

    int ni() throws Exception {
        in.nextToken();
        return (int) in.nval;
    }

    void px(Object... l1) {
        System.out.println(Arrays.deepToString(l1));
    }

    B() throws Exception {
        int pairs = ni();
        int n1 = pairs * 2;
        int[] l1 = new int[n1];

        Count c1 = new Count();
        for (int i = 0; i < n1; i++) {
            l1[i] = ni();
            c1.add(l1[i]);
        }
        int mult1 = 0;
        int sing1 = 0;
        HashSet<Integer> mult = new HashSet();
        for (int e : c1.m1.keySet()) {
            int k1 = c1.m1.get(e);
            if (k1 >= 2) {
                mult1++;
                mult.add(e);
            } else
                sing1++;
        }

        // px(mult,single);
        int left = 0;
        int max = Integer.MIN_VALUE;
        int minsing = Math.max(sing1 + mult1 - pairs, 0);
        for (int i = minsing; i <= sing1; i++) {
            if (i + mult1 > pairs)
                break;
            int q1 = mult1 + i;
            int q2 = mult1 + sing1 - i;
            if (q1 * q2 > max) {
                max = q1 * q2;
                left = i;
            }
        }
        // px(left);
        HashSet<Integer> heap1 = new HashSet();
        ArrayList<Integer> id1 = new ArrayList();
        HashSet<Integer> heap2 = new HashSet();
        ArrayList<Integer> id2 = new ArrayList();
        boolean[] used = new boolean[n1];
        for (int i = 0; i < n1 && heap1.size() < mult1; i++) {
            if (used[i])
                continue;
            if (mult.contains(l1[i]))
                if (!heap1.contains(l1[i])) {
                    heap1.add(l1[i]);
                    id1.add(i);
                    used[i] = true;
                }
        }
        for (int i = 0; i < n1 && heap2.size() < mult1; i++) {
            if (used[i])
                continue;
            if (mult.contains(l1[i]))
                if (!heap2.contains(l1[i])) {
                    heap2.add(l1[i]);
                    id2.add(i);
                    used[i] = true;
                }
        }
        //px(heap1,heap2);
        for (int i = 0; i < n1 && heap1.size() < left+mult1; i++) {
            if (used[i])
                continue;
            if (!heap1.contains(l1[i])) {
                heap1.add(l1[i]);
                id1.add(i);
                used[i] = true;
            }
        }
        for (int i = 0; i < n1 && heap2.size() < sing1 - left+mult1; i++) {
            if (used[i])
                continue;
            if (!heap2.contains(l1[i])) {
                heap2.add(l1[i]);
                id2.add(i);
                used[i] = true;
            }
        }
        //px(heap1,heap2);
        // px(id1);
        // px(id2);
        for (int i = 0; i < n1; i++) {
            if (used[i])
                continue;
            if (id1.size() < pairs) {
                id1.add(i);
                used[i] = true;
            } else
                break;
        }
        for (int i = 0; i < n1; i++) {
            if (used[i])
                continue;
            if (id2.size() < pairs) {
                id2.add(i);
                used[i] = true;
            } else
                break;
        }
        // px(id1);
        // px(id2);
        int[] fin = new int[n1];
        for (int e : id1) {
            fin[e] = 1;
        }
        for (int e : id2) {
            fin[e] = 2;
        }

        System.out.println(max);
        StringBuilder sb1 = new StringBuilder();
        for (int i = 0; i < n1; i++) {
            sb1.append(fin[i] + " ");
        }
        System.out.println(sb1);
    }

    class Count {
        TreeMap<Integer, Integer> m1 = new TreeMap();

        void add(int n1) {
            int old = 0;
            if (m1.containsKey(n1))
                old = m1.get(n1);
            m1.put(n1, old + 1);
        }
    }
}