#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) begin(v), end(v)
#define FOR(i,a,b) for(int i=(a);i<(int)(b);i++)
#define rep(i,b) FOR(i,0,b)

const ll mod = 1e9+7;
ll INF = 1000;

ll n,k,a[100010],b[100010],ans;
int main(){
  cin>>n;
  rep(i,n)cin>>a[i];

  sort(a,a+n-1);

  rep(i,n-1)cout<<a[i]<<" ";

  cout<<a[n-1]<<endl;

  return 0;
}