#include<bits/stdc++.h>
using namespace std;
int n;
int a[1005],b[1005];
bool check(){
    for(int i=1;i<=n;i++){
        if(b[i]!=a[i])return 0;
    }
    return 1;
}
signed main(){
    //freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        b[i]=a[i];
    }
    sort(b+1,b+1+n);
    if(check()){
        cout<<-1;
        return 0;
    }
    for(int i=1;i<=n;i++){
        cout<<b[i]<<" ";
    }
    return 0;
}

#include<bits/stdc++.h>
//#pragma GCC optimize("O3")
using namespace std;
#define endl '\n'
#define int long long
const int N=1005;
int n;
bool flag=0;
int a[N];
signed main(){
    //freopen("string.in","r",stdin);
//  freopen("ceshi.out","w",stdout);
    ios::sync_with_stdio(0);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout.flush();
    cin>>n;
    if(n==0||n==1){
        cout<<-1;
        return 0;
    }
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=2;i<=n;i++){
        if(a[i]<=a[i-1]){
            flag=1;
            break;
        }
    }
    if(flag==0){
        cout<<-1;
    }
    else{
        sort(a+1,a+1+n);
        for(int i=1;i<=n;i++){
            cout<<a[i]<<' ';
        }
    }
    return 0;
}