#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010


int main(){
  int n;
  int a[SIZE];

  scanf("%d",&n);

  for(int i=0;i<n;i++){
    scanf("%d",a+i);
  }

  for(int k=0;k<n*2-3;k++){

    for(int p=0;p<n;p++){
      int q = k-p;
      if(p >= q) break;
      if(q < 0 || p < 0 || n <= q || n <= p) continue;

      if(a[p] > a[q])
        swap(a[p],a[q]);
    }
  }

  for(int i=0;i<n;i++){
    printf("%d%c",a[i]," \n"[i==n-1]);
  }
  
  return 0;
}