#include<time.h>
#include<algorithm>
#include<deque>
#include <set>
#include<algorithm>

using namespace std;

//multiset<long long int> Esort;
//multiset<long long int>::iterator it;


int main()
{
	freopen("algsort.in","r",stdin);
	freopen("algsort.out","w",stdout);
    
	long int n,x,a[500001];
	scanf("%d\n",&n);
	for(int i=0;i<n;i++) 
	{
		scanf("%d",&a[i]);
			
	}
	sort(a,a+n);

	for(int i=0;i<n;i++) printf("%d ",a[i]);
	
	return 0;
}