#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<vector>
typedef long long int ll;
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define EREP(i,n) for (int i=1;i<=(n);i++)
const int MOD = 1000000007;
const int INF = 1000000;

ll a,b,ans,M,temp;
ll A[5010];
int N;
int p,q;
 int main(){
     scanf("%d",&N);
     REP(i,N)scanf("%lld",&A[i]);
     EREP(i,2*N-4){
        if(i<N){p=i;q=0;}
        else { q=i-N+1;p=i-q-1;}
         REP(j,i+1){
             if(A[p]>A[q]){
                 int temp=A[q];
                 A[q]=A[p];
                 A[p]=temp;
             }
             p--;
             q++;
             if(p==0){break;}
         }
     }
     REP(i,N)printf("%lld",A[i]);
     return 0;

 }