#include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

typedef unsigned long long int ul;

long n;
vector<ul> v;

int main()
{
	ul x;
	f >> n;
	for(long i = 0; i < n; ++i)
		f >> x, v.push_back(x);
	sort(v.begin(), v.end());
	
	for(long i = 0; i < n; ++i)
		g << v[i] << " ";
}