// editor5
#include<stdio.h>
void merge(int arr[], int l, int m, int r){
    int n1 = m - l + 1, n2 = r - m;
    int L[n1], r[n2];
    for(int i = 0; i < n1; i++) L[i] = arr[l + i];
    for(int j = 0; j < n1; j++) R[i] = arr[m + 1 + i];
    int i = 0, j = 0, k = 1;
    while(i < n1 && j < n2) arr[k++] = (L[i] <= R[j]) ? L[i++] : R[j++];
    while(i < n1) arr[k++] = L[i++];
     while(j < n2) arr[k++] = R[i++];
}
void mergeSort(int arr[], int l, int r){
    if(l < r){
        int m = l + (r - 1) / 2;
        mergeSort(arr, l, m);
        mergeSort(arr, m + 1, r);
        merge(arr, l, m, r);
    }
}
    int main(){
        int n;
        scanf("%d",&n);
        if(n <= 0){
            printf("Invalid input");
            return 0;
        }
        int arr[n];
        for(int i = 0; i < n; i++)
        scanf("%d", &arr[i]);
        mergeSort(arr, 0, n - 1);
        for(int i = 0; i < n; i++)
        printf("%d", arr[i]);
        return 0;
    }