#include <iostream>
#include <queue>
#include <vector>
#include <stdio.h>

int n;

using namespace std;

void print_queue(priority_queue<int, vector<int>, greater<int> > q){
    while(!q.empty()){
        cout << q.top() << " ";
        q.pop();
    }
    cout << "\n";
}

int main(){
    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);

    int k = 0;

    priority_queue<int, vector<int>, greater<int> > q;

    cin >> n;
    for(int i=0; i<n; i++){
        cin >> k;
        q.push(k);
    }
    print_queue(q);
    return 0;
}