#include <stdio.h>
#include <iostream>
#include <cstring>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#include <string>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <deque>
#define nmax 500010
using namespace std;
int n,i,t[nmax];
bool cmp(const int &x,const int &y)
{
    return (x<y);
}
int main(){
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++) scanf("%d",&t[i]);
sort(t+1,t+n+1,cmp);
for (i=1;i<=n;i++) printf("%d ",t[i]);
return 0;
}