#include <stdio.h>
#include <vector>
#include <utility>
#include <algorithm>

using namespace std;

vector <int> v;
vector <int>::iterator it;

int n,i,x;

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

scanf("%d",&n);
for(i=1;i<=n;i++){scanf("%d",&x);v.push_back(x);}
stable_sort(v.begin(),v.end());
for(it=v.begin();it!=v.end();++it)
printf("%d ",*it);


return 0;
}