#include <iostream>

using namespace std;

const int N =  1e5 + 10;

int n =0;
int q[N] = {0};

void quik_sort(int q[],int l,int r)
{
    if (l >= r) return;

    int i = l -1;
    int j = r +1; 
    int x = q[(l + r) >> 1];
    while (i<j) {
        do {i++;} while (q[i]< x);
        do {j--;} while (q[j]> x);
        if (i<j){
        swap(q[i],q[j]);
        }
    }
    quik_sort(q,l,j);
    quik_sort(q,j+1,r);
}

int main(int argc,char *argv[])
{
    scanf("%d",&n);
    for(int i = 0;i < n;i++){
        scanf("%d",&q[i]);
    }

    quik_sort(q,0,n-1);

    for(int i = 0;i < n;i++){
        printf("%d ",q[i]);
    }
}