include[HTML_REMOVED]

include[HTML_REMOVED]

using namespace std;
const int N = 1e5+9;
void m_qsort(int* a,int l,int r){
if(l >= r) return;
inr key = a[(l+r)>>1];
int i = l-1,j = r+1;
while(i < j){
do i;while(a[i] < key);
do j–; while(a[j] < key);
if(i < j) swap(a[i],a[j]);
}
m_qsort(a,l,j);
while(a,j+1,r);
}
int main(){
int n;
cin >> n;
for(int i= 0;i < n;i) cin >> a[i];
m_qsort(a,0,n-1);
for(int i = 0;i < n;i++) cout << a[i] << ‘ ‘;
return 0;
}