#include <iostream>
#include <fstream>
#include <stdlib.h>
#include <algorithm>
#include <ctime>

using namespace std;

const int NMAX = 500001;
ifstream in("algsort.in");
ofstream out("algsort.out");
int n;
int *A;

void quicksort(int x,int y)
{
    if(x<y)
    {
        int i=x,j=y;
        swap(A[x],A[i+rand()%(j-i+1)]);
        int pivot = A[i+rand()%(j-i+1)];
        while(i<j)
        {
            if(A[i] > A[j])
            swap(A[i],A[j]);
            if(A[i]==pivot)
            j--;
            else
            i++;
        }
        int m = i;
        quicksort(x,m-1);
        quicksort(m+1,y);
    }
}

int main()
{
    srand(time(NULL));
    in>>n;
    A = new int[n+3];
    for(int i=1;i<=n;i++)
    in>>A[i];
    quicksort(1,n);
    for(int i=1;i<=n;i++)
    out<<A[i]<<" ";
    out.close();

    return 0;
}