#include<bits/stdc++.h> using namespace std; int n; int a[10010]; int r[10010]; void msort(int start,int end,int a[],int r[]){ if(start==end)return ; int mid=(start+end)/2; int i=start,j=mid+1,k=start; msort(start,mid,a,r); msort(mid+1,end,a,r); while(i<=mid&&j<=end){ if(a[i]<=a[j]){ r[k]=a[i]; i++; k++; } else{ r[k]=a[j]; j++; k++; } } while(i<=mid){ r[k]=a[i]; k++; i++; } while(j<=end){ r[k]=a[j]; k++; j++; } for(int i=start;i<=end;++i)a[i]=r[i]; } int main(){ cin>>n; for(int i=1;i<=n;++i)cin>>a[i]; cin>>a[n+1]; msort(1,n+1,a,r); for(int i=1;i<=n+1;++i)cout<<a[i]<<" "; return 0; }