#include <cstdio>
#include <algorithm>
using namespace std;

int n,v[500005];

int main(){
    int x;
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&x);
            v[i]=x;
        }
        sort(v+1,v+n+1);
        for(int i=1;i<=n;i++)
        {
            printf("%d ",v[i]);
        }
    return 0;
}