#include <fstream>
#include <queue>
#include <cstring>
#include <ctime>
#include <algorithm>

using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");

const int NMAX = 500001;

int N;

int v[NMAX]; 

void read() {

	fin >> N;
	
	for(int i = 1 ; i <= N; ++i)
		fin >> v[i];
}


int main() {


	read();

	sort(v + 1, v + 1 + N);

	for(int i = 1; i <= N; i++)
		fout << v[i] << " ";

	return 0;
}