#include<iostream>

using namespace std;

const int N = 100010;

int A[N];

void swap(int &a, int &b){
    a ^= b;
    b ^= a;
    a ^= b;
}

void quicksort(int left, int right){
    if(left >= right)return ;
    int i = left - 1, j = right + 1;
    int x = A[left + right >> 1];
    while(i < j){
        do{i ++;}while(A[i] < x);
        do{j --;}while(A[j] > x);
        if(i < j)swap(A[i], A[j]);
    }
    quicksort(left, j);
    quicksort(j + 1, right);
}
int main(){
    int n;
    cin >> n;
    for(int i = 0;i < n;i ++)cin >> A[i];
    quicksort(0, n - 1);
    for(int i = 0;i < n;i ++)cout << A[i] << " ";
    return 0;
}