#include <iostream>
#include <cstdio>
#include <cstring>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <algorithm>
#include <set>
#include <deque>
#include <queue>
#include <string>
#include <map>
#include <stack>
#include <sstream>
#include <vector> 
#include <ctime>
#include <bitset>
using namespace std;

int n;
int a[2000001];
int getint();

int main()
{
	freopen("sorttest.in","r",stdin);
	freopen("sorttest.out","w",stdout);
	cin>>n;
	for(int i=0;i<n;i++)
	{
		a[i]=getint();
	}
	sort(a,a+n);
	for(int i=0;i<n-1;i++)
	{
		printf("%d ",a[i]);
	}
	cout<<a[n-1]<<endl;
	return 0;
}
int getint()
{
	int x=0,s=1;
	char ch=' ';
	while (ch<'0' || ch>'9')
	{
		ch=getchar();
		if(ch=='-')
			s=-1;
	}
	do
	{
		x=x*10+ch-'0';
		ch=getchar();
	}while (ch>='0' && ch<='9');
	
	return x*s;
}