#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string.h>
#include <stdlib.h>
#define NMax 500000
#define INF   100000000000000000LL
int n;
int v[NMax];
int Divide(int li, int ls)
{
	int st = li, dr = ls, x = v[li];
	while (st < dr)
	{
		while (st < dr && x <= v[dr])
			dr--;
		v[st] = v[dr];
		while (st < dr && x >= v[st])
			st++;
		v[dr] = v[st];
	}
	v[st] = x;
	return st;
}
void quickSort(int li, int ls)
{
	int m = Divide(li, ls);
	if (m - 1 > li)
		quickSort(li, m-1);
	if (m + 1 < ls)
		quickSort(m+1, ls);
}
int compare (const void * a, const void * b)
{
  return ( *(int*)a - *(int*)b );
}
int main()
{
	FILE *f = fopen("admitere.txt", "r");
	FILE *g = fopen("bla.txt", "w");
	fscanf(f, "%d", &n);
	for (int i=1; i<=n; i++)
		fscanf(f, "%d", &v[i]);
	qsort(v+1, n, sizeof(int), compare);
	for (int i=1; i<=n; i++)
		fprintf(g, "%d ", v[i]); 
	fclose(f); fclose(g);
	return 0;
}