#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

int n;
vector <int>a;

int main()
{
	int i, x;
	
	freopen("algsort.in", "r", stdin);
	freopen("algsort.out", "w", stdout);
	
	scanf("%d", &n);
	for(i = 1; i <= n; i++)
	{
		scanf("%d", &x);
		a.push_back(x);
	}
	
	sort(a.begin(), a.end());
	
	for(i = 0; i < n; i++) printf("%d ", a[i]);
	
	return 0;
}