#include <bits/stdc++.h> using namespace std; queue<quest> bin[1000001]; int li[1000001]; int li2[1000001]; void merge_sort(int L, int R) { if (L == R) return; int mid = (L + R) >> 1; merge_sort(L, mid); merge_sort(mid + 1, R); int l = L, ln = mid; int r = mid + 1, rn = R; int st = L; while (l <= ln && r <= rn) { if (li[l] <= li[r]) li2[st++] = li[l++]; else li2[st++] = li[r++]; } while (l <= ln) li2[st++] = li[l++]; while (r <= rn) li2[st++] = li[r++]; for (int i = L; i <= R; i++) li[i] = li2[i]; }; int main() { int n; scanf("%d", &n); for (int i = 1; i <= n; i++) scanf("%d", &li[i]); merge_sort(1, n); for (int i = 1; i <= n; i++) printf("%d ", li[i]); }