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


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

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<<" ";
    }
}