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

using namespace std;

#define maxN 500005

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

class sorting {
public:
	
	void read ();
	void solve_write ();
	
private:
	
	int A[maxN];
	int N;
	
};

void sorting :: read ()
{
	f >> N;
	
	for (int i = 1 ; i <= N ; ++i)
		f >> A[i];
}

void sorting :: solve_write ()
{
	sort (A + 1 , A + N + 1);
	
	for (int i = 1 ; i <= N ; ++i)
		g << A[i] << " ";
}

int main ()
{
	sorting compute;
	
	compute.read ();
	compute.solve_write ();
	
	return 0;
}