#include<stdio.h>
#include<stdlib.h>

void guibingpaixu(int *p, int *q, int left, int right);
void guibingcaozuo(int *p, int *q, int left, int right);

int main(){
	int n;
	scanf("%d", &n);
	int *p = NULL, *q = NULL;
	p = (int*)malloc(sizeof(int) * n);
	q = (int*)malloc(sizeof(int) * n);
	for(int i = 0;i < n;i ++){
		scanf("%d", &p[i]);
	}
	guibingpaixu(p, q, 0, n - 1);
	for(int i = 0;i < n;i ++){
		printf("%d ", p[i]);
	}
	printf("\n");
	return 0;
}

void guibingpaixu(int *p, int *q, int left, int right){
	if(left < right){
		int middle = (left + right) / 2;
		guibingpaixu(p, q, middle + 1, right);
		guibingpaixu(p, q, left, middle);
        	guibingcaozuo(p, q,  left, right);
	}
}

void guibingcaozuo(int *p, int *q, int left, int right){
	int middle = (left + right) / 2;
	int mid = middle + 1;
	int i = left;
	int j = mid;
	int k = left;
	while(i < mid && j <= right){
		if(p[i] < p[j]){
			q[k] = p[i];
			i ++;
			k ++;
		}
		else if(p[i] > p[j]){
			q[k] = p[j];
			j ++;
			k ++;
		}
	}
	while(i < mid){
		q[k] = p[i];
		i ++;
		k ++;
	}
	while(j <= right){
		q[k] = p[j];
		j ++;
		k ++;
	}
	for(int m = left;m <= right;m ++){
		p[m] = q[m];
	}
}