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 a_1, a_2, …, a_{2n} (1 ≤ a_i ≤ 10^6) — 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.
import java.io.* ;

public class ProblemA {


    public static void solve() throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int m = Integer.parseInt(br.readLine());
        int n = 2*m ;
        String[] q = br.readLine().split(" ") ;
        int[] a = new int[n] ;

        for(int i=0 ; i<n ; i++){
            a[i] = Integer.parseInt(q[i]) ;
        }

        int t = n , temp , l=0 ,r=0 , flag=0;
        for(int i=0 ; i<n/2 ; i++){
            l+=a[i] ;
        }
        for(int i=n/2 ; i<n ; i++){
            r+=a[i] ;
        }
        if(l!=r){
            for(int i=0 ; i<n ; i++){
                System.out.print(a[i]+" ");
            }
        }
        else if(l==r){
            for(int i=0 ; i<m ; i++){
                for(int j=m ; j<n ; j++){
                    if(a[i]!=a[j]){
                        temp  = a[i] ;
                        a[i] = a[j] ;
                        a[j] = temp ;

                        for(int k=0 ; k<n ; k++){
                            System.out.print(a[k]+" ");
                        }
                        return;
                    }
                }

            }
            System.out.println("-1");
        }

    }


    public static void main(String[] args) throws IOException {
        solve() ;
    }
}