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

using namespace std;

#define maxN 500005

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

void sorting :: read ()
{
	scanf ("%d" , &N);
	
	for (int i = 1 ; i <= N ; ++i)
		scanf ("%d" , &A[i]);
}

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

int main ()
{
	freopen ("algsort.in" , "r" , stdin);
	freopen ("algsort.out" , "w" , stdout);
	
	sorting compute;
	
	compute.read ();
	compute.solve_write ();
	
	return 0;
}