# include <cstdio>
# include <time.h>
# include <stdlib.h>

using namespace std;

# define FIN "algsort.in"
# define FOUT "algsort.out"
# define MAX_N 500005

int N, K, i;
int V[MAX_N];

    void sort(int st, int dr)
    {
        int i = st, j = dr, piv = V[(st + dr) >> 1];
        
        while (i <= j)
        {
              while (V[i] < piv) ++i;
              while (V[j] > piv) --j;
              if (i <= j)
              {
                    int ax = V[i];
                    V[i] = V[j];
                    V[j] = ax;
                    ++i; --j;
              }
        }
        
        if (st < j) sort(st, j);
        if (i < dr) sort(i, dr);
    }

    int main()
    {
        freopen(FIN, "r", stdin);
        freopen(FOUT, "w", stdout);
        
        scanf("%d", &N);
        for (i = 1; i <= N; ++i) scanf("%d", &V[i]);
        
        sort(1, N);
        
        for (i = 1; i <= N; ++i) printf("%d ", V[i]);
        
        return 0;
    }