include[HTML_REMOVED]
using namespace std;
const int N = 1e6+9;
int n;
int q[N];
void quick_sort(int l,int r)
{
if(l >= r) return;
int i = l-1,j = r+1,x = q[l + r >> 1];
while(i[HTML_REMOVED]x);
if(i < j) swap(q[i],q[j]);
}
quick_sort(l,j);
quick_sort(j+1,r);
}
int main()
{
cin>>n;
for(int i = 0;i < n;i)
scanf(“%d”,&q[i]);
quick_sort(0,n-1);
for(int i = 0;i < n;i)
printf(“%d “,q[i]);
return 0;
}