#include <bits/stdc++.h>
using namespace std;

int piv(vector<int> &arr,int low,int high)
{
    int piv=low;
    int i=low,j=high;
    while(i<=j)
    {
        if(arr[piv]<arr[i] && arr[piv]>arr[j])
        {
            swap(arr[i],arr[j]);
            i++;
            j--;
        }
        if(arr[piv]>arr[i])
        {
            i++;
        }
        if(arr[piv]<arr[j])
        {
            j--;
        }
    }swap(arr[j],arr[low]);
    return j;
}

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

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