#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
long long A[500001];
long long n,i;

FILE *fin=fopen("algsort.in","r");
FILE *gout=fopen("algsort.out","w");

int main()
{
	fscanf(fin,"%d",&n);
	for (i=1;i<=n;i++)
		fscanf(fin,"%d",&A[i]);
	sort(A+1,A+n+1);
	for (i=1;i<=n;i++)
		fprintf(gout,"%d ",A[i]);
	fclose(fin);
	fclose(gout);
	return 0;
}