← 返回题目

题库练习 Ehab Fails to Be Thanos

← 上一题下一题 →

A12596 | $Ehab Fails to Be Thanos$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You're given an array $a$ of length $2n$ . Is it possible to reorder it in such way so that the sum of the first $n$ elements isn't equal to the sum of the last $n$ elements?

输入格式

The first line contains an integer $n$ ( $1 \le n \le 1000$ ), where $2n$ is the number of elements in the array $a$ . The second line contains $2n$ space-separated integers $a_1$ , $a_2$ , $\ldots$ , $a_{2n}$ ( $1 \le a_i \le 10^6$ ) — the elements of the array $a$ .

输出格式

If there's no solution, print "-1" (without quotes). Otherwise, print a single line containing $2n$ space-separated integers. They must form a reordering of $a$ . You are allowed to not change the order.

输入输出样例

输入 #1

3
1 2 2 1 3 1

输出 #1

2 1 3 1 1 2

输入 #2

1
1 1

输出 #2

-1

C++ 编辑器

输入

输出