#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
 {
     int t;
 cin>>t;
 int array[t];
 //if(t<=10*10*10*10*10*10)         NO NEED FOR THIS CONDITION as the inps are designed in such a way that u need not check overflow of constraints!!!!
  //{
      for(int i=0;i<t;i++)
       { 
          scanf("%d",&array[i]);    //cin>>array[i]; to slow will give tle
       }
      sort(array,array+t);
       for(int n=0;n<t;n++)
       {
           //if(array[n]!=array[n+1])  NO NEED FOR THIS CONDITION! as no such condition exists!!!
            printf("%d\n",array[n]);//cout<<array[n]<<endl;     cout too slow and print newline after every output!!!
       }   
  //}
  return 0;
 } 

I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPHN0ZGlvLmg+CiNpbmNsdWRlPGFsZ29yaXRobT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IG1haW4oKQogewogICAgIGludCB0OwogY2luPj50OwogaW50IGFycmF5W3RdOwogLy9pZih0PD0xMCoxMCoxMCoxMCoxMCoxMCkgICAgICAgICBOTyBORUVEIEZPUiBUSElTIENPTkRJVElPTiBhcyB0aGUgaW5wcyBhcmUgZGVzaWduZWQgaW4gc3VjaCBhIHdheSB0aGF0IHUgbmVlZCBub3QgY2hlY2sgb3ZlcmZsb3cgb2YgY29uc3RyYWludHMhISEhCiAgLy97CiAgICAgIGZvcihpbnQgaT0wO2k8dDtpKyspCiAgICAgICB7IAogICAgICAgICAgc2NhbmYoIiVkIiwmYXJyYXlbaV0pOyAgICAvL2Npbj4+YXJyYXlbaV07IHRvIHNsb3cgd2lsbCBnaXZlIHRsZQogICAgICAgfQogICAgICBzb3J0KGFycmF5LGFycmF5K3QpOwogICAgICAgZm9yKGludCBuPTA7bjx0O24rKykKICAgICAgIHsKICAgICAgICAgICAvL2lmKGFycmF5W25dIT1hcnJheVtuKzFdKSAgTk8gTkVFRCBGT1IgVEhJUyBDT05ESVRJT04hIGFzIG5vIHN1Y2ggY29uZGl0aW9uIGV4aXN0cyEhIQogICAgICAgICAgICBwcmludGYoIiVkXG4iLGFycmF5W25dKTsvL2NvdXQ8PGFycmF5W25dPDxlbmRsOyAgICAgY291dCB0b28gc2xvdyBhbmQgcHJpbnQgbmV3bGluZSBhZnRlciBldmVyeSBvdXRwdXQhISEKICAgICAgIH0gICAKICAvL30KICByZXR1cm4gMDsKIH0g

NQo1CjMKNgo3CjE=

5
5
3
6
7
1