#include <bits/stdc++.h>
using namespace std;
int n,a[500010];
int partitie(int low,int high)
{
    int pivot=a[high],i=low-1;
    for(int j=low;j<=high;j++)
    {
        if(a[j]<=pivot)
        {
            i++;
            swap(a[j],a[i]);
        }
    }
    return i;
}

void quicksort(int low,int high)
{
    if(low<high)
    {
        int p=partitie(low,high);
        quicksort(low,p-1);
        quicksort(p+1,high);
    }
}

int main()
{
    ifstream cin("algsort.in");
    ofstream cout("algsort.out");
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    quicksort(1,n);
    for(int i=1;i<=n;i++)cout<<a[i]<<' ';

    return 0;
}