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

using namespace std;

vector<int>v;

//ifstream fin("algsort.in","r");
//ofstream fout("algsort.out","w");

int main()
{
	freopen("algsort.in","r",stdin);
	freopen("algsort.out","w",stdout);
	int n;
	scanf("%d",&n);
	for(int i=1; i<=n; i++)
	{
		int x;
		scanf("%d",&x);
		v.push_back(x);
	}
	
	sort(v.begin(), v.end());
	int i;
	for(i=0;i<n;i++)
		printf("%d ",v[i]);
	
	return 0;
}