#include <bits/stdc++.h>
using namespace std;
int fast_exp(long long base, long long exp) {
  if (exp == 1) {
    return base % 1000000007;
  }
  if (exp & 1) {
    int ans = fast_exp(base, exp - 1);
    return (base % 1000000007 * ans % 1000000007) % 1000000007;
  } else {
    int ans = fast_exp(base, exp / 2);
    return (ans % 1000000007 * ans % 1000000007) % 1000000007;
  }
}
int fast_exp_itr(long long base, long long exp, long long p) {
  long long ans = 1;
  base = base % p;
  while (exp > 0) {
    if (exp & 1) {
      ans = ((ans % p) * (base % p)) % p;
    }
    exp >>= 1;
    base = ((base % p) * (base % p)) % p;
  }
  return ans;
}
int euclid_gcd(int a, int b) {
  if (b == 0) {
    return a;
  }
  return euclid_gcd(b, a % b);
}
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  for (int i = 0; i < n; i++) {
    cout << arr[i] << " ";
  }
  cout << "\n";
  return 0;
}
