#include<iostream>
#include<algorithm>

using namespace std;

void quick_sort(int nums[],int low,int high)
{
    if(low>=high)
    {
        return;
    }
    
    int l=low;
    int r=high;
    int tmp=nums[l];
    while(l<r)
    {
        while(nums[r]>tmp&&l<r)
        {
            r--;
        }
        while(nums[l]<=tmp&&l<r)
        {
            l++;
        }
        if(l<r)
        {
            swap(nums[l],nums[r]);
        }
    }
    swap(nums[low],nums[r]);
    quick_sort(nums,low,l-1);
    quick_sort(nums,l+1,high);
}

int main()
{
    int n,a[100005];
    cin>>n;
    for(int i=0;i<n;++i)
    {
        cin>>a[i];
    }
    quick_sort(a,0,n-1);
    for(int i=0;i<n;++i)
    {
        cout<<a[i]<<" ";
    }
    return 0;
}

求哭o(╥﹏╥)o