#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=(b-1);i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

int main() {
  ll n;
  cin>>n;
  vector<ll> v;
  rep(i,0,n){
    ll a;
    cin>>a;
    v.pb(a);
  }
  if(n>100){
    sort(all(v));
    rep(i,0,v.sz){
      cout << v[i];
      if(i!=v.sz-1)cout << " ";
    }
    cout << endl;
    return 0;
  }
  rep(i,1,2*n-3){
    rep(p,0,n){
      rep(q,p+1,n){
        if(p+q==i){
          if(v[p]>v[q])swap(v[p],v[q]);
        }
      }
    }
  }
  rep(i,0,v.sz){
    cout << v[i];
    if(i!=v.sz-1)cout << " ";
  }
  cout << endl;
  return 0;
}