//#include <bits/stdc++>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int , int> pair_ii;
typedef pair<ll , ll> pair_ll;

#define rep(i , x , n) for(int (i) = (x); i < (n); i++)
#define rrep(i , n , x) for(int (i) = (n); i >= (x); i--)

const int mod = 1000000007;
const int INF = 100100100;
const double pi = 3.14159265358979;

//vector<int> ans;
//set<ll> ans;
//vector<int> table(20010 , 0);
//vector<int> dp(n + 10 , 0);
//vector<vector<int>> dp(n + 10 , vector<int>(2 , 0));

ll gcd(ll a , ll b){if(a < b)swap(a , b);if(a % b == 0)return b;else return gcd(b , a % b);}
ll lcm(ll a , ll b){return a / gcd(a , b) * b;}
bool chmax(ll &a , ll &b){if(a < b){a = b;return true;}else{return false;}}
bool chmin(ll &a , ll &b){if(a > b){a = b;return true;}else{return false;}}

bool is_prime(ll n){
	if(n == 2 || n == 3 || n == 5 || n == 7)return true;
	for(int i = 2; i * i <= n; i++){if(n % i == 0)return false;}
	return true;
}

void prime_fact(ll n){
	vector<int> ans;ll x = n;
	for(int i = 2; i * i <= n; i++){while(x % i == 0){ans.push_back(i);x /= i;}}
	if(x > 1)ans.push_back(x);
}

void divisor(ll n){
    set<ll> ans;
    rep(i , 1 , sqrt(n) + 10){if(n % i == 0)ans.insert(i);if(i != (n / i))ans.insert(n / i);}
}

void solve(){
    int n;
    cin >> n;
    vector<int> a(n);
    rep(i , 0 , n)cin >> a[i];
    sort(a.begin() , a.end());
    rep(i , 0 , n){
        cout << a[i];
        if(i != n - 1)cout << " ";
        else cout << endl;
    }
}

int main(){
	//cout << fixed << setprecision(20) << endl;
	cin.tie(0);
	ios::sync_with_stdio(false);
	//int t;cin >> t;for(int i = 0; i < t; i++)
	solve();
    return 0;
}