#include <fstream>
#include <algorithm>

using namespace std;

#define INFILE "algsort.in"
#define OUTFILE "algsort.out"
#define VMAX 500001

ifstream fin (INFILE);
ofstream fout (OUTFILE);

int n, v[VMAX];

void solve(){

    fin >> n;
    for(int i = 0; i < n; ++i){
        fin >> v[i];
    }

    sort(v, v + n);

    for(int i = 0; i < n; ++i){
        fout << v[i] << " ";
    }

}

int main(){
    solve();
    return 0;
}