Codeforces Round #563 (Div. 2) 1174A. Ehab Fails to Be Thanos

A. Ehab Fails to Be Thanos

ime limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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?

Input

The first line contains an integer n (1≤n≤1000), where 2n is the number of elements in the array a.

The second line contains 2n space-separated integers a1, a2, …, a2n (1≤ai≤106) — the elements of the array a.

Output

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.

Examples

input

3
1 2 2 1 3 1

output

2 1 3 1 1 2

input

1
1 1

output

1

Note

In the first example, the first n elements have sum 2+1+3=6 while the last n elements have sum 1+1+2=4. The sums aren’t equal.

In the second example, there’s no solution.

思路：

水题，不讲了

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<string>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define ll long long
#define mes(x,y) memset(x,y,sizeof(x))
#define maxn 2147483648+30
using namespace std;
int main(){
	 std::ios::sync_with_stdio(false);
	 ll x,y,i,j;
	 while(cin>>x){
	 	vector<ll>v;v.clear();
	 	for(i=0;i<2*x;i++){
	 		cin>>y;v.push_back(y);
		 }
		 sort(v.begin(),v.end());
		 ll sum_n1=0,sum_n2=0;
		 for(i=0;i<2*x;i++){
		 	if(i<x){
		 		sum_n1+=v[i];
			 }
			 if(i>=x){
			 	sum_n2+=v[i];
			 }
		 }
		 if(sum_n1!=sum_n2){
		 	for(i=0;i<2*x;i++){
		 		cout<<v[i]<<" ";
			 }
			 cout<<endl;
		 }
		 else{
		 	cout<<"-1"<<endl;
		 }
	 }
}