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

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int, int> P;

int n;
vector<int> a;

void yukisort() {
  rep2(i, 1, 2 * n - 3) {
    rep(p, n) {
      int q = i - p;
      if (not (p < q) or not (q <= n - 1)) continue;
      if (a[p] > a[q]) {
        swap(a[p], a[q]);
      }
    }
  }
}

void solve() {
  cin >> n;
  rep(i, n) {
    int in;
    cin >> in;
    a.push_back(in);
  }
  yukisort();
  cout << a[0];
  rep2(i, 1, n) {
    cout << ' ' << a[i];
  }
  cout << endl;
}

int main() {
  solve();
  return 0;
}