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

using namespace std;

vector<int> v;
vector<int>::iterator it;
int i, N, x;

void read(void)
{
	freopen("algsort.in", "r", stdin);
	scanf("%d", &N);
	for(register int i = 1; i <= N; i++)
		scanf("%d", &x), v.push_back(x);
	
	fclose(stdout);
}
void print(void)
{
	freopen("algsort.out", "w", stdout);
    for(it = v.begin();  it != v.end(); it++)
		printf("%d ", *it);

	fclose(stdout);
}

int main(void)
{
	read();
	sort(v.begin(), v.end());
	print();
	
	return 0;
}