#include<iostream>
#include<algorithm>
using namespace std;
bool cmp(int a,int b){
    return a>b;
}
int main(){
    int n;
    while(cin>>n){
        int a[n],count=0;
        for(int i=0;i<n;i++){
            cin>>a[i];
            count++;
        }
        sort(a,a+n,cmp);
        printf("%d\n",a[0]);
        if(count==1){
            cout<<-1<<endl;
            continue;
        }
        sort(a+1,a+n);
        for(int i=1;i<n;i++){
            printf("%d ",a[i]);
        }
        printf("\n");
    }
}