#include <bits/stdc++.h>
using namespace std;
ifstream fin ("algsort.in"); ofstream fout ("algsort.out");
int n;
vector <int> a;

int main ()
{
	fin >> n ;
	for (int i = 1; i <= n; i++)
	{
		int x;
		fin >> x;
		a.push_back(x);
	}
	sort (a.begin(), a.end());
	for (int i = 0; i <= n - 1; i++)
		fout << a[i] << ' ';
	return 0;
}