#include<bits/stdc++.h>
using namespace std;
int Sort(vector<int> &arr,int low,int high)
{
    int i=low;
    int j=high;
    int pivot=arr[low];
    while(i>j)
    {
        if(arr[i]>=pivot && arr[j]<pivot)
        {
            swap(arr[i],arr[j]);
            i++;
            j--;
        }
        while(arr[i]<pivot)
        {
            i++;
        }
        while(arr[j]>pivot)
        {
            j--;
        }
    }swap(arr[low],arr[j+1]);
    return j+1;
}

void mergeSort(vector<int> &arr,int low,int high)
{
    if(low>=high)
    return;
    int piv=Sort(arr,low,high);
    Sort(arr,low,piv-1);
    Sort(arr,piv+1,high);
}

int main()
{
    int n;
    cin >> n;
    
    vector<int> arr(n);
    
    for(int i=0;i<n;i++)
    cin >> arr[i];
    
    mergeSort(arr,0,n-1);
    
    for(auto it:arr)
    cout<<it<<" ";
}