//Dragan Andrei Gabriel - Grupa 131
//Insertion Sort

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<climits>
#define dim 500000
using namespace std;
int n,v[dim],x;

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