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

const int maxn=2000000+1;
int a[maxn],n;

int main()
{
	freopen("sorttest.in","r",stdin);
	freopen("sorttest.out","w",stdout);
	
	cin>>n;
	for (int i=1; i<=n; i++)
	{
		scanf("%d",&a[i]);
	}
	sort(a+1,a+n+1);
	for (int i=1; i<=n; i++)
	{
		printf("%d ",a[i]);
	}
	cout<<endl;
	return 0;
}