#include<stdio.h>
#include<math.h>
#define MAX 500000
#define INF 1000000000

void merge(int *,int,int,int);
void mergesort(int *,int,int);

int tmp[MAX];

int main()
{
  int n,i;
  int *A;

  scanf("%d",&n);

  for(i = 0;i < n;i++){
    scanf("%d",&A[i]);
  }
  mergesort(A,0,n);

  for(i = 0;i < n;i++){
    printf("%d",A[i]);
  }
  return 0;
}

void merge(int *A,int left,int mid,int right)
{
  int i,k=0,j,n1=0,n2=0;
  int L[n1],R[n2];

  n1 = mid - left;
  n2 = right - mid;

  for(i = 0;i <= n1-1;i++){
    L[i] = A[left + i];
  }
  for(i = 0;i <= n2-1;i++){
    R[i] = A[mid + i];
  }
  L[n1] = INF;
  R[n2] = INF;
  i = 0;
  j = 0;

  for(k = left;k <= right;k++){
    if(L[i] <= R[j]){
      A[k] = L[i];
      i++;
    }
    else {
      A[k] = R[j];
      j++;
    }
  }
}

void mergesort(int *A,int left,int right)
{
  int mid=0;
  if(left + 1 < right){
    mid = (left + right) / 2;
    mergesort(A,left,mid);
    mergesort(A,mid+1,right);
    merge(A,left,mid,right);
  }
}