include [HTML_REMOVED]
using namespace std;
const int N = 1e6 + 10;
int n;
int q[N];
void quick_Sort(int q[],int low,int high){
if(low >= high) return;
int guard = q[(low + high)/2],i = low - 1,j = high + 1;
while(i < j){
do i++; while(q[i] < guard);
do j--; while(q[j] > guard);
if(i < j) swap(q[i],q[j]);
}
quick_Sort(q,low,j);
quick_Sort(q,j + 1,high);
}
int main(){
scanf(“%d”,&n);
for(int i = 0;i < n;i++) scanf("%d",&q[i]);
quick_Sort(q,0,n - 1);
for(int i = 0;i < n;i++) printf("%d ",q[i]);
return 0;
}