#include<stdio.h>
#include<stdlib.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[j]){
            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);
        mergeSort(arr, left, mid, right);
    }
}
int main(){
    int N;
    scanf("%d", &N);
    if(N <= 0){
        printf("Invalid input");
        return 0;
    }
    int prices[N];
    for(int i = 0; i < N; i++){
        scanf("%d", &prices[i]);
    }
   MergeSort(prices, 0, N - 1);
    
    for(int i = 0; i < N; i++){
        printf("%d ", prices[i]);
    }
     return 0;   
}