#include<iostream>
#include<stdlib.h>
using namespace std;

long int n;
long long A[500001];

void citire(void)
{
     FILE *f = fopen("algsort.in","r");
     
     fscanf(f,"%ld",&n);
     for(long long i=1;i<=n;i++)
        fscanf(f,"%ld",&A[i]);
     
     fclose(f);
}

void sort(void)
{
     long long temp;
     for(long int i=1;i<n;i++)
        for(long int j=i+1;j<=n;j++)
           if(A[i]>A[j])
           {
             temp = A[j];
             A[j] = A[i];
             A[i] = temp;
           }
}

void afisare(void)
{
     FILE *f = fopen("algsort.out","w");
     
     for(long int i=1;i<=n;i++)
        fprintf(f,"%d ",A[i]);
     
     fclose(f);
}

int compare (const void * a, const void * b)
{
  return ( *(long long*)a - *(long long*)b );
}

int main()
{
    citire();
    qsort(A,n+1,sizeof(long long),compare);
//    sort();
    afisare();
}