#include <bits/stdc++.h>

using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

int n;
vector < int > v;

void quick_sort(vector < int > &v, int left, int right) {
  if (left < right) {
    int mid = (left + right) / 2;
    int aux = v[left];
    v[left] = v[mid];
    v[mid] = aux;
    int i = left;
    int j = right;
    int d = 0;
    while (i < j) {
      if (v[i] > v[j]) {
        aux = v[i];
        v[i] = v[j];
        v[j] = aux;
        d = 1 - d;
      }
      i += d;
      j -= 1 - d;
    }
    quick_sort(v, left, i - 1);
    quick_sort(v, i + 1, right);
  }
}

int main() {
  f >> n;
  v.resize(n + 1);
  for (int i = 1; i <= n; ++i) {
    f >> v[i];
  }
  for (int i = 1; i <= n; ++i) {
    g << v[i] << " ";
  }
}