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

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

int N, x;
std::vector<int> v;

void Read()
{
	f >> N;

	v.reserve(N);

	for (int i = 1; i <= N; ++i) {
		f >> x;
		v.emplace_back(x);
	}
}

int main(int argc, char * argv[])
{
	Read();

	std::sort(v.begin(), v.end());

	for (int i = 0; i < v.size(); ++i) {
		g << v[i] << ' ';
	}

	return 0;
}