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