Number Selection Game

You are given an integer $N$ such that $N = 2^k$ and $1 \le k \le 10$. Then $2N - 1$ integers are given.

Choose exactly $N$ of the given numbers so that the sum of the chosen numbers is divisible by $N$. Print the chosen $N$ numbers. If several answers are possible, print any one of them.

The first line contains $N$.

The second line contains $2N - 1$ integers. Each integer is between $0$ and $1000$, inclusive.

On the first line, print $N$ numbers separated by spaces whose sum is divisible by $N$.

If several answers are possible, print any one of them. If no such selection exists, print -1.