#include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <ctime>
#include <ratio>
#include <chrono>
#include <fstream>

using namespace std;

void sortare(vector<int>& Vector, int left, int right){
    if (left<right){
        int pivot = Vector[right], j = left;
        for(int i=left; i<right; i++){
            if(Vector[i] <= pivot){
                swap(Vector[j++], Vector[i]);
            }
        }
        swap(Vector[j], Vector[right]);

        sortare(Vector, j+1, right);
        sortare(Vector, left, j-1);
    }
}

int main(){
    ifstream f("algsort.in");
    ofstream g("algsort.out");
    vector<int> V;
    int a, N;
    f>>N;
    while(N>0){
        f>>a;
        V.push_back(a);
        N--;
    }
    sortare(V, 0, V.size()-1);
    for(long unsigned int i=0; i<V.size(); i++){
        g<<V[i]<<" ";
    }
    return 0;
}