//#include "stdafx.h"
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <windows.h>

using namespace std;

int n;
vector<int> v;
queue<int> Q;
ifstream in("algsort.in");
ofstream out("algsort.out");

void read()
{
	in >> n;
	for (int i = 0; i<n; i++)
	{
		int x;
		in >> x;
		v.push_back(x);
	}
}
int main()
{
	read();
	sort(v.begin(), v.end());
	for (int i = 0; i < n; i++)
		out << v[i]<<' ';
    return 0;
}