#include<stdio.h>
void merge(int arr[],int left,int mid,int right)
{
    int n1=mid-left+1;
    int n2=right-mid;
    int L[n1],R[n2];
    for(int i=0;i<n1;i++)
        L[i]=arr[left+i];
    for(int j=0;j<n2;j++)
        R[j]=arr[mid+1+j];
    int i=0,j=0,k=left;
    while(i<n1&&j<n2)
    {
        if(L[i]<=R[i])
            arr[k++]=L[i++];
        else
            arr[k++]=R[j++];
    }
    while(i<n1)
        arr[k++]=L[i++];
    while(j<n2)
        arr[k++]=R[j++];
}
void mergesort(int arr[],int left,int right)
{
    if(left<right)
    {
        int mid=left+(right-left)/2;
        mergesort(arr,left,mid);
        mergesort(arr,mid+1,right);
        merge(arr,left,mid,right);
    }
}
int isSorted(int arr[],int n)
{
    for(int i=1;i<n;i++)
    {
        if(arr[i]<arr[i=1])
            return 0;
    }
    return 1;
}
int main()
{
    int n;
    scanf("%d",&n);
    if(n<=1||n>=100)
    {
        printf("Invalid input");
        return 0;
    }
    int arr[n];
    for(int i=0;i<n;i++)
    {
        scanf("%d",&arr[i]);
        if(arr[i]<=-100||arr[i]>=100)
        {
            printf("Invalid input");
            return 0;
        }
        if(arr[i]<0)
        {
            printf("Invalid input");
            return 0;
        }
    }
    if(isSorted(arr,n))
    {
        printf("-1");
        return 0;
    }
    mergesort(arr,0,n-1);
    for(int i=0;i<n;i++)
    {
        printf("%d",arr[i]);
        if(i!=n-1)
            printf(" ");
    }
    return 0;
}