#include<algorithm>
#include<iostream>
#include<vector>

using namespace std;

int n, x;
vector<int> a;

int main() {
    freopen("algsort.in", "rt", stdin);
    freopen("algsort.out", "wt", stdout);
    scanf("%d", &n);
    while (n--) {
          scanf("%d", &x);
          a.push_back(x);
    }
    sort(a.begin(), a.end());
    for (int i = 0; i < a.size(); i++) printf("%d ", a[i]);
}