#include <vector>
#include <algorithm>
#include <stdio.h>
#define N 1000000
using namespace std;
vector<int> p;
int v[N];
struct comp
{int operator() (int p1,int p2)
 {if(v[p1]<v[p2])
  {return 1;}
  return 0;
 }
}mycomp;

int main ()
{int i,n,x;

 freopen("algsort.in","r",stdin);
 freopen("algsort.out","w",stdout);
 scanf("%d",&n);
 
 for (i=0;i<n;i++)
 {scanf("%d",&v[i]);
 }
 
 for (i=0;i<n;i++)
  p.push_back(i);

 sort(p.begin(),p.end(),mycomp);
 
 for (i=0;i<n;i++)
 {printf("%d ",v[p[i]]);
 }
 return 0;
}