1. *******#include<bits/stdc++.h>

2. using namespace std;*

   int x,n[10003],y;*

int a[500000],c[500000];*

void Sort(int l,int r){*

    if(l==r){*
  
	  return;*
  
  }int mid=(l+r)/2;*

  Sort(l,mid);*

  Sort(mid+1,r);*

  int s1=l,s2=mid+1;*

  int s3=l;*

  while(s1<=mid&&s2<=r){*

	  if(a[s1]<=a[s2]){*
  
		  c[s3]=a[s1];*
    
		  s3++;*
    
		  s1++;*
    
	  }*
  
	  else{*
  
		  c[s3]=a[s2];*
    
		  s3++;*
    
		  s2++;*
    
	  }*
  
  }*

  while(s1<=mid){*

	  c[s3]=a[s1];*
  
	  s3++;*
  
	  s1++;*
  
  }*

  while(s2<=r){*

	  c[s3]=a[s2];*
  
	  s3++;*
  
      s2++;	*
      
  }

  for(int i=1;i<=r;i++){*

	  a[i]=c[i];*
  
  }*

}*

int main(){*

  cin>>x;*

  for(int i=1;i<=x;i++){*

	  cin>>a[i];*
  
  }*

  Sort(1,x);*

  for(int i=1;i<=x;i++){*

	  cout<<a[i]<<" ";*
  
  }*

  return 0;*

}**