# include <cstdio>
# include <algorithm>
using namespace std;
struct elem
{
    int a,b;
}v[500001];
int i,n;
int cmp(elem x, elem y)
{
    if (x.a>y.a) return 0;
    else if (x.a==y.a && x.b<=y.b) return 0;
    return 1;
}
int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);
    for(i=1; i<=n; ++i)
    {
        scanf("%d",&v[i].a);
    }
    sort(v+1, v + n + 1,);
    for (i=1; i<=n; ++i)
    {
        printf("%d %d\n",v[i].a,);
    }
    return 0;
}