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

void Sort(vector<int>& arr,int low,int mid,int high)
{
    vector<int> temp;
    int left=low;
    int right=mid+1;
    
    while(left<=mid && right<=high)
    {
        if(arr[left]<=arr[right] && left<=mid)
        {
            temp.push_back(arr[left]);
            left++;
        }
        else if(arr[left]>arr[right] && right<=high)
        {
            temp.push_back(arr[right]);
            rigth++;
        }
    }
    while(left<=mid)
    {
        temp.push_back(arr[left]);
        left++;
    }
    while(right<=high)
    {
        temp.push_back(arr[right]);
        rigth++;   
    }
    
    for(int i=low;i<=high;i++)
    {
        arr[i]=temp[i-low];
    }
}

void mergeSort(vector<int>& arr,int low,int high)
{
    if(low>=high)
    {
        return;
    }
    int mid=(low+high)/2;
    mergeSort(arr,low,mid);
    mergeSort(arr,mid+1,high);
    Sort(arr,low,mid,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(int i=0;i<n;i++)
    cout<<arr[i]<<" ";
}