#include <bits/stdc++.h>
using namespace std;

void siftdown(vector<int> &a , int i) {
    int l = 2*i + 1;
    int r = 2*i + 2;
    int ind = i;
    if ((l < a.size()) && (a[ind] < a[l]))
        ind = l;
    if (( r < a.size()) && (a[ind] < a[r]))
        ind = r;
    if (ind != i)
        swap(a[i], a[ind]);
    siftdown(a, ind);
}
int build(vector<int> &a){
    for (int i = a.size() / 2 ; i >= 0; --i )
        siftdown(a, i);
 }
 int heapsort(vector<int> &a ){
     build(a);
     for (int i = a.size() - 1; i >= 0; --i)
         swap (a[0], a[i]);
 }

int main(void) {
     int N;
    vector<int> arr;
     cin >> N;
    for (int i = 0; i < N; i++) {
 		int x;
		cin>>x;
		arr.push_back(x)
	}
    heapsort(arr);
    for (int i = 0; i < N; ++i)
        cout << arr[i] <<" ";
}