Multiples of N (2)

Time limit1sMemory limit512 MB

Summary

Given 2N-1 integers, each at least 0 and less than N, pick N of them whose sum is divisible by N, or print -1 if none exists.

Problem

You are given $2N-1$ numbers. Find $N$ of them whose sum is divisible by $N$ .

The first line contains $N$ ( $1 \le N \le 5\ 000$ ).

The second line contains $2N-1$ numbers, each at least $0$ and less than $N$ , separated by spaces.

Print $N$ numbers that satisfy the condition, separated by spaces, on the first line.

If several answers exist, printing any one of them is accepted. The order of the printed numbers does not matter.

If no set of $N$ numbers satisfies the condition, print -1.