#include <iostream>
#include <algorithm>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");

vector <int> x;
int main(){
int i,aux,n;
fin >> n;
for(i=1;i<=n;i++) {
        fin >> aux;
        x.push_back(aux);
}
sort(x.begin(),x.end());

for(i=0;i<n;i++) fout << x[i] << " ";
return 0;
}