#include <cstdio>
#include <algorithm>
#include <vector>
using std::vector;
using std::sort;

#define IN "algsort.in"
#define OUT "algsort.out"

vector<long> v;

int main() {

    long n, i, x;

    freopen(IN, "r", stdin); freopen(OUT, "w", stdout);

    scanf("%ld", &n);

    for(i = 0; i < n; ++i) {

        scanf("%ld", &x);
        v.push_back(x);
    }

    sort(v.begin(), v.end());

    for(i = 0; i < n; ++i)
        printf("%ld ", v[i]);
    printf("\n");

    return 0;
}