For each test case, print a single integer $-1$ if it is impossible to assign a chess club to each friend so that every friend's party is successful.

Otherwise, print $n$ integers $c_1, c_2, \ldots, c_n$, where $c_i$ is the number of the chess club that friend $i$ should join ($1 \le c_i \le n$). If there are multiple answers, print any of them.