#define Dudica "Dudescu Alexandru"
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
FILE *f1=fopen("algsort.in","r"),*f2=fopen("algsort.out","w");
vector <long> v;
int n,i;
int main()
{
    fscanf(f1,"%d",&n);
    for(;n;n--){fscanf(f1,"%d",&i);v.push_back(i);}
    sort(v.begin(),v.end());
    for(i=0;i<v.size();i++)
        fprintf(f2,"%d ",v[i]);
    fclose(f1);
    fclose(f2);
    return 0;
}

//Our greatest weakness lies in giving up. The most certain way to succeed is always to try just one more time.