#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
vector <int> v;
int main()
{
    int n,i,x;
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;++i){
        scanf("%d",&x);
        v.push_back(x);
    }
    sort(v.begin(),v.end()+1);
    for(i=0;i<n-1;++i)printf("%d ",v[i]);
    printf("%d\n",v[n-1]);
    return 0;
}