CF BUDDY
← Problems·

1725H · Hot Black Hot White

1800 · constructive algorithms, math

Problem: One day, you are accepted as being Dr. Chanek's assistant. The first task given by Dr. Chanek to you is to take care and store his magical stones.

Dr. Chanek has NN magical stones with NN being an even number. Those magical stones are numbered from 11 to NN. Magical stone ii has a strength of AiA_i. A magical stone can be painted with two colours, namely the colour black or the colour white. You are tasked to paint the magical stones with the colour black or white and store the magical stones into a magic box with a magic coefficient ZZ (0Z20 \leq Z \leq 2). The painting of the magical stones must be done in a way such that there are N2\frac{N}{2} black magical stones and N2\frac{N}{2} white magical stones.

Define concat(x,y)\text{concat}(x, y) for two integers xx and yy as the result of concatenating the digits of xx to the left of yy in their decimal representation without changing the order. As an example, concat(10,24)\text{concat}(10, 24) will result in 10241024.

For a magic box with a magic coefficient ZZ, magical stone ii will react with magical stone jj if the colours of both stones are different and concat(Ai,Aj)×concat(Aj,Ai)+Ai×AjZmod3\text{concat}(A_i, A_j) \times \text{concat}(A_j, A_i) + A_i \times A_j \equiv Z \mod 3. A magical stone that is reacting will be very hot and dangerous. Because of that, you must colour the magical stones and determine the magic coefficient ZZ of the magic box in a way such that there is no magical stone that reacts, or report if it is impossible.

Input Format: The first line contains a single even integer NN (2N1052 \le N \le 10^5) — the number of magical stones Dr. Chanek has.

The second line contains NN integer A1,A2,,ANA_1, A_2, \ldots, A_N (1Ai1091 \leq A_i \leq 10^9) — the strengths of all magical stones.

Output Format: If it is not possible to satisfy the condition of the problem, output 1-1.

Otherwise, output two lines. The first line contains an integer ZZ denoting the magic coefficient of the magic box. The second line contains a string SS of length NN. SiS_i is 00 if magical stone ii is coloured black or 11 if magical stone ii is coloured white. If there are more than one possibilities of colouring and choosing the magic coefficient ZZ, output any of them.

Note: By giving the above colouring, it can be seen that:

  • i=1,j=2concat(4,10)×concat(10,4)+10×4=410×104+40=426802mod3i=1, j=2 \longrightarrow \text{concat}(4, 10) \times \text{concat}(10, 4) + 10 \times 4 = 410 \times 104 + 40 = 42680 \equiv 2 \mod 3
  • i=1,j=3concat(4,9)×concat(9,4)+4×9=49×94+36=46421mod3i=1, j=3 \longrightarrow \text{concat}(4, 9) \times \text{concat}(9, 4) + 4 \times 9 = 49 \times 94 + 36 = 4642 \equiv 1 \mod 3
  • i=4,j=2concat(14,10)×concat(10,14)+10×14=1410×1014+140=14298802mod3i=4, j=2 \longrightarrow \text{concat}(14, 10) \times \text{concat}(10, 14) + 10 \times 14 = 1410 \times 1014 + 140 = 1429880 \equiv 2 \mod 3
  • i=4,j=3concat(14,9)×concat(9,14)+14×9=149×914+126=1363121mod3i=4, j=3 \longrightarrow \text{concat}(14, 9) \times \text{concat}(9, 14) + 14 \times 9 = 149 \times 914 + 126 = 136312 \equiv 1 \mod 3

Because of that, by choosing Z=0Z = 0, it can be guaranteed that there is no magical stone that reacts.

Sample Cases

Case 1

Input

4
4 10 9 14

Output

0
1001

Similar problems

00:00:00
Loading editor…
Welcome! I'm your coding tutor for this problem. Use the chips below to reveal stored hints or get AI feedback on your code. I'll guide you step by step — never giving away the solution.

Sign in to unlock AI tutor feedback