#include<fstream>
using namespace std;
int n,a[500001];
ifstream fin("algsort.in");
ofstream fout("algsort.out");

int main()
{
   fin>>n;
   for(int p=0;p<n;p++) fin>>a[p];
    int i,schimbat,aux;
    do
    {
        schimbat = 0;
        for(i = 0; i < n-1; i++)  
         if(a[i] > a[i+1])           
         {                   
            aux = a[i];
            a[i] = a[i+1];
            a[i+1] = aux;
            schimbat = 1;     
         }
    }while(schimbat);
   for(int k=0;k<n;k++) fout<<a[k]<<" ";
   
    
    
    
    
    
    
    
    return 0;
}