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

using namespace std;

class sorting {
public:
	
	void read ();
	void solve_write ();
	
private:
	
	vector <int> A;
	int N;
};

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

void sorting :: solve_write ()
{
	sort (A.begin () , A.end ());
	
	vector <int> :: iterator it;
	
	for (it = A.begin () ; it != A.end () ; ++it)
		printf ("%d " , *it);
}

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