#include <fstream>
#include <algorithm>

using namespace std;
ifstream f ("algsort.in");
ofstream g ("algsort.out");
int i,n,v[500001];
void read(){
    for(i=1;i<=n;i++)
        f>>v[i];

    }

void solve (){
    sort(v+1 , v+n+1);
        }

void print (){
    for(i=1;i<=n;i++)
        g<<v[i]<<" ";
    }

int main()
{f>>n;
read();
solve();
print();

    return 0;
}