#include <bits/stdc++.h>
#define int long long

#define endl '\n'


#define rep(i, l, b) for (int i = l; i <= b; i++)

#define lep(i, b, l) for (int i = b; i >= l; i--)


const int N = 1e6 + 10, INF = 0x3f3f3f3f3f3f, MOD = 1e7 + 7, B = 13331;

using namespace std;

int n, m;
int a[N];

void solve() {
    cin >> n;
    rep(i, 1, n) cin >> a[i];
    sort(a + 1, a + 1 + n);
    rep(i, 1, n) cout << a[i] << " ";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    // freopen("2.in","r",stdin);
    // freopen("2.out","w+",stdout);
    int _ = 1;
    // cin>>_;
    while (_--) {
        solve();
    }

    return 0;
}