#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

ifstream in("algsort.in");
ofstream out("algsort.out");

int n;
vector<int> V;

void read(){
    in>>n;
    for(int i=1,x;i<=n;i++){
        in>>x;
        V.push_back(x);
    }
}
void solve(){
    sort(V.begin(),V.end());
    for(auto x : V)
        out<<x<<" ";
}
int main(){
    read();
    solve();
    return 0;
}