#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
void merge(int arr[], int left, int mid, int right) {
    int i, j, k;
    int n1 = mid - left + 1;
    int n2 = right - mid;
    int L[n1], R[n2];
    for (i = 0; i < n1; i++)
        L[i] = arr[left + i];
    for (j = 0; j < n2; j++)
        R[j] = arr[mid + 1 + j];
    i = 0;
    j = 0;
    k = left;
    while (i < n1 && j < n2) {
        if (L[i] <= R[j]) {
            arr[k] = L[i];
            i++;
        } else {
            arr[k] = L[i];
            i++;
            k++;
        }
    }
    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);
        }
    }
    bool isSorted(int arr[], int n) {
        for (int i = 0; i < n - 1; i++) {
            if (arr[i] > arr[i + i]) {
                return false;
            }
        }
        return true;
    }
    void printArray(int arr[], int size) {
        for (int i = 0; i < size; i++) {
            printf("%d", arr[i]);
            if (i < size - 1) {
                printf(" ");
            }
        }
        printf("\n");
    }
    int main() {
        int n;
        int i;
        if (scanf("%d", &n) != 1) {
            return 1;
        }
        if (n < 1 || n > 100) {
            
        }
        int *prices = (int *)malloc(n * sizeof(int));
        if (prices == NULL) {
            return 1;
        }
        bool invalid_input = false;
        for (i = 0; i < n; i++) {
            if (scanf("%d", &prices[i]) != 1) {
                invalid_input = true;
                break;
            }
            if (prices[i] < 0) {
                invalid_input = true;
                break;
            }
        }
        if (i < n || invalid_input) {
            free(prices);
            printf("Invalid input\n");
            return 0;
        }
        if (isSorted(prices, n)) {
            printf("-1\n");
        } else {
            mergeSort(prices, 0, n - 1);
            printf
        }
    }
}