#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> v;
vector<int>::iterator it;
int n,i,x;
FILE *f,*g;
int main(){
    f=fopen("algsort.in","r");
    g=fopen("algosrt.out","w");
    fscanf(f,"%d",&n);
    for(i=1;i<=n;i++){
        fscanf(f,"%d",&x);
        v.push_back(x);
    }
    sort(v.begin(),v.end());
    for(it=v.begin();it!=v.end();it++){
        fprintf(g,"%d ",*it);
    }
    fclose(f);
    fclose(g);
    return 0;
}