#include<fstream>
#include<cstdio>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define bit 20
#define inf (1<<30)
#define base 256
#define ba 255
#define N 500100
#define mod  1999999973
#define inu "algsort.in"
#define outu "algsort.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
int v[N],n;
int main ()
{
    f>>n;
    FOR(i,1,n)
    f>>v[i];
    sort(v+1,v+n+1);
    FOR(i,1,n)
    g<<v[i]<<" ";
    return 0;
}