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

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

void quickSort(vector<int>& arr,int low,int high)
{
    int pivot=Sort(arr,low,high);
    quickSort(arr,low,pivot);
    quickSort(arr,pivot+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(int i=0;i<n;i++)
    cout<<arr[i]<<" ";
}