#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
#include <functional>
#include <sstream>
#include <fstream>
#include <iostream>
using namespace std;
#define FOR(i,a,b) for (i=a;i<=b;i++)
#define fori(it,v) for (it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
#define pf push_front
#define popb pop_back
#define popf pop_front
FILE *in,*out;
vector<int> a;
int main()
{
	int i,n,x;
	in=fopen("algsort.in","r");
	out=fopen("algsort.out","w");
	fscanf(in,"%d",&n);
	a.resize(n);
	FOR(i,1,n)
	{
		fscanf(in,"%d",&x);
		a[i-1]=x;
	}
	sort(all(a));
	FOR(i,0,n-1)
		fprintf(out,"%d ",a[i]);
	fclose(in);
	fclose(out);
	return 0;
}