#include <iostream>
#include <cstdio>
using namespace std;
const int N = 1E5 + 10;
int a[N];
int n;
void read(){
    cin >> n;
    for(int i = 0; i < n; i ++ )    scanf("%d", &a[i]);
}
void print(){
    for(int i = 0; i < n; i ++ ){
        cout << a[i];
        if(i == n - 1)  cout << endl;
        else    cout << " ";
    }
}
void quick_sort(int l, int r){
    if(l == r)  return ;
    int aim = a[l + r + 1 >> 1];
    int i, j;
    i = l - 1, j = r + 1;
    while(i < j){
        do  i ++ ; while(a[i] < aim);
        do  j -- ; while(a[j] > aim);
        if(i < j)   swap(a[i], a[j]);
    }
    quick_sort(l, i - 1);
    quick_sort(i, r);
}
int main(){
    read();
    quick_sort(0, n - 1);
    print();
    return 0;
}