#include <bits/stdc++.h>
using namespace std;
class DSU {
 private:
  vector<int> ids;
  vector<int> h;

 public:
  DSU(int n) {
    ids.resize(n);
    h.resize(n);
    for (int i = 0; i < n; i++) {
      ids[i] = i;
      h[i] = 1;
    }
  }
  int getRoot(int ind) {
    if (ids[ind] != ind) return getRoot(ids[ind]);
    return ind;
  }
  bool connected(int ind1, int ind2) { return getRoot(ind1) == getRoot(ind2); }
  void connect(int ind1, int ind2) {
    if (connected(ind1, ind2)) return;
    int r1 = getRoot(ind1);
    int r2 = getRoot(ind2);
    if (h[r1] > h[r2]) {
      ids[r2] = r1;
      h[r1] += h[r2];
    } else {
      ids[r1] = r2;
      h[r2] += h[r1];
    }
  }
  void showId(int n) {
    for (int i = 0; i < n; i++) {
      printf("%d ", ids[i]);
    }
    printf("\n");
  }
};
long long gcd(long long a, long long b) {
  while (b != 0) {
    long long t = a % b;
    a = b;
    b = t;
  }
  return a;
}
long long lcd(long long a, long long b) { return a / gcd(a, b) * b; }
int sgn(int n) {
  if (n < 0) return -1;
  if (n > 0) return 1;
  return 0;
}
int const MOD = 1000000007;
int modS(int a, int b) { return (a + b) % MOD; }
int main() {
  int n;
  scanf("%d", &n);
  vector<int> arr(n);
  for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
  sort(arr.begin(), arr.end());
  for (int i : arr) printf("%d ", i);
  return 0;
}
