#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <map>
#include <string>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <algorithm> 
#include <ctime>

#define MaxN 500005

using namespace std;

FILE *IN,*OUT;

int N,v[MaxN];
int main()
{
	IN=fopen("algsort.in","r");
	OUT=fopen("algsort.out","w");
	fscanf(IN,"%d",&N);
	for(int i=1;i<=N;i++)
		fscanf(IN,"%d",&v[i]);
	sort(v+1,v+1+N);
	for(int i=1;i<=N;i++)
		fprintf(OUT,"%d ",v[i]);
    return 0;
}