#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

vector <int> v;

int main() {
	ifstream f("algsort.in");
	ofstream g("algsort.out");

	int n, i, val;
	f>>n;
	for(i=1; i<=n; i++) {
		f>>val;
		v.push_back(val);
	}

    sort(v.begin(), v.end());
    for(i=0; i<v.size(); i++) g<<v[i]<<" "; g<<"\n";

	return 0;
}