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

int n;
bool comp(int a,int b){ return a<b; }
bool (*point)(int,int)=comp;
multiset<int,bool(*)(int,int)>s(point);

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);
            s.insert(x);
        }
        for(int i=1;i<=n;i++)
        {
            printf("%d ",*s.begin());
            s.erase(s.begin());
        }
    return 0;
}