#include<cstdio>
#include<ctime>
#include<algorithm>
using namespace std;

int N, myArray[1 << 19];

int Partition(int a[], int l, int r){
int pivot, i, j, temp;
pivot = a[l];
i = l; j = r+1;
while( 1)
{
do ++i; while( a[i] <= pivot && i <= r );
do --j; while( a[j] > pivot );
if( i >= j ) break;
swap(a[i], a[j]);
}
swap(a[l], a[j]);
return j;
}
void QuickSort(int sequence[], int left, int right){

    if(left < right){
        int split = Partition(sequence, left, right);
        QuickSort(sequence, left, split);
        QuickSort(sequence, split + 1, right);
    }
}

int main() {

freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);

scanf("%d", &N);

for(int i = 0; i < N; i++){
    scanf("%d", &myArray[i]);
}srand(time(NULL));

QuickSort(myArray, 0, N-1);

for(int i = 0; i < N; i++){
    printf("%d ", myArray[i]);
}
return 0;
}