#include <algorithm>
#include <vector>
using namespace std;

#define pb push_back

vector <int> v;
int n;

void read ()
{
    int i,x;

    scanf ("%d",&n);
    for (i=1; i<=n; ++i)
    {
        scanf ("%d",&x);
        v.pb (x);
    }
}

void print ()
{
    vector <int> :: iterator it;

    for (it=v.begin (); it!=v.end (); ++it)
        printf ("%d ",*it);
}

int main ()
{
    freopen ("algsort.in","r",stdin);
    freopen ("algsort.out","w",stdout);

    read ();
    sort (v.begin (),v.end ());
    print ();

    return 0;
}