#include <iostream>
#include <cstdio>
#include <algorithm>

#define fs fscanf
#define fp fprintf

using namespace std;

FILE *f;

int n, v[500005], i;

void Read()
{
    f = fopen("algsort.in", "r");

    fs(f, "%d", &n);

    for(i = 1; i <= n; i ++)
    {
        fs(f, "%d", &v[i]);
    }

    fclose(f);
}

void Write()
{
    f = fopen("algsort.out", "w");

    for(i = 1; i <= n; i ++)
    {
        fp(f, "%d ", v[i]);
    }

    fclose(f);
}

void algsort(int v[], int sp, int ep) // start point, end point
{
    sort(v+sp, v+ep+sp);
}

int main()
{
    Read();
    algsort(v, 1, n);
    Write();
    return 0;
}