//count sort
 
#include<bits/stdc++.h>
using namespace std;
 
int main(){
int n,i;
cin>>n;
int a[n];
for(i=0;i<n;i++)cin>>a[i];
int mx=0;
for(i=0;i<n;i++) mx=max(mx,a[i]);
int count[mx+1];
for(i=0;i<=mx;i++)count[i]=0;
 
for(i=0;i<n;i++){
    count[a[i]]++;
}
//sub-array sum
int sum[mx+1];
sum[0]=count[0];
for(i=1;i<=mx;i++){
    sum[i]=sum[i-1]+count[i];
}
 
int sorted[n];
for(int i=n-1;i>=0;i--){
    sum[a[i]]--;
    int idx=sum[a[i]];
    sorted[idx]=a[i];
}
for(i=0;i<n;i++){
    cout<<sorted[i]<<" ";
}
return 0;
}

Ly9jb3VudCBzb3J0CgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKXsKaW50IG4saTsKY2luPj5uOwppbnQgYVtuXTsKZm9yKGk9MDtpPG47aSsrKWNpbj4+YVtpXTsKaW50IG14PTA7CmZvcihpPTA7aTxuO2krKykgbXg9bWF4KG14LGFbaV0pOwppbnQgY291bnRbbXgrMV07CmZvcihpPTA7aTw9bXg7aSsrKWNvdW50W2ldPTA7Cgpmb3IoaT0wO2k8bjtpKyspewogICAgY291bnRbYVtpXV0rKzsKfQovL3N1Yi1hcnJheSBzdW0KaW50IHN1bVtteCsxXTsKc3VtWzBdPWNvdW50WzBdOwpmb3IoaT0xO2k8PW14O2krKyl7CiAgICBzdW1baV09c3VtW2ktMV0rY291bnRbaV07Cn0KCmludCBzb3J0ZWRbbl07CmZvcihpbnQgaT1uLTE7aT49MDtpLS0pewogICAgc3VtW2FbaV1dLS07CiAgICBpbnQgaWR4PXN1bVthW2ldXTsKICAgIHNvcnRlZFtpZHhdPWFbaV07Cn0KZm9yKGk9MDtpPG47aSsrKXsKICAgIGNvdXQ8PHNvcnRlZFtpXTw8IiAiOwp9CnJldHVybiAwOwp9

NAoxIDIgNQoxMTIgCgoyMiAKMgoK

4
1 2 5
112 

22 
2