#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>

#define MAXN 500003

#define inFile  "algsort.in"
#define outFile "algsort.out"

using namespace std;

vector<int> V;
int N, X;

void read(void)
{
  FILE * f = fopen(inFile, "r");
  fscanf(f, "%d", &N);
  for (int i = 1; i <= N; i++)
  {
    fscanf(f, "%d", &X),
    V.push_back(X); /* Adaug in V pe X */
  }
  fclose(f);
}

void write(void)
{
  FILE * g = fopen(outFile, "w");
  for (vector<int>::iterator i = V.begin(); i != V.end(); i++)
  {
    fprintf(g, "%d ", *i);
  }
  fclose(g);
}

int main()
{
  read();
  make_heap(V.begin(), V.end());
  sort_heap(V.begin(), V.end());
  write();

  return 0;
}