#include<bits/stdc++.h> #define up(i,l,r) for(int i=(l);i<=(r);++i) #define down(i,l,r) for(int i=(l);i>=(r);--i) #define pi pair<int,int> #define p1 first #define p2 second #define m_p make_pair #define p_b push_back typedef long long ll; using namespace std; const int maxn=3e6+10,mod=1e9+7; int n,a[maxn]; inline ll read(){ ll x=0;short t=1;char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')t=-1;ch=getchar();} while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar(); return x*t; } void slv(){ n=read();up(i,1,n)a[i]=read(); sort(a+1,a+n+1); up(i,1,n)cout<<a[i]<<' '; }int main(){ // freopen("seq.in","r",stdin),freopen("seq.out","w",stdout); slv(); fclose(stdin); fclose(stdout); return 0; }