#include <iostream>

#include <string.h>
#include <fstream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");
template <class X , int SIZE=500010> class Vect
{
    X *ZonaFolosita;
    int SizeF;
    X *ZonaAlocata;
    int SizeA;

public:
    Vect();
    int getSizeF() {return SizeF;}
    int getSizeA() {return SizeA;}
    void add(X ob);
    X &operator[] (int i);
    void deleteFinal();
    void deletePoz(int poz);
    void sortare(int left, int right);
    void afisare();
    void cautare(X ob);
};

template <class X, int SIZE>
Vect <X,SIZE>::Vect()           //Vect::Vect()
{
    ZonaFolosita= (X*) malloc (SIZE *sizeof(X) );
    //ZonaAlocata = (X*) malloc (SIZE * sizeof(X));
    SizeA=SIZE;
    SizeF=0;
}

template <class X, int SIZE>
X& Vect <X,SIZE>:: operator[](int i)
{
    if(i<0 || i>=SizeF)
    {
        cout<<"\n\nNu puteti accesa un element de pe pozitia: "<<i<<"!\n";
        exit(0);
    }
    return ZonaFolosita[i];
}

template <class X, int SIZE> void
Vect <X,SIZE>::add(X ob)
{
    if(SizeF<SizeA)
    {
        SizeF++;
        //ZonaFolosita=(X *)realloc(ZonaFolosita , SizeF * sizeof(X));

        ZonaFolosita[SizeF-1] = ob;

        //memcpy(ZonaAlocata, ZonaFolosita, SizeF * sizeof(X));
        //ZonaAlocata =(X *)realloc(ZonaAlocata , SizeA * sizeof(X));
    }
    else
    {
        SizeA= 2* SizeA;
        ZonaAlocata =(X *)realloc(ZonaAlocata , SizeA * sizeof(X));
        SizeF++;
        ZonaFolosita=(X *)realloc(ZonaFolosita , SizeF * sizeof(X));
        ZonaFolosita[SizeF-1] = ob;
        memcpy(ZonaAlocata, ZonaFolosita, SizeF * sizeof(X));
        ZonaAlocata =(X *)realloc(ZonaAlocata , SizeA * sizeof(X));
    }

}

template <class X , int SIZE> void
Vect <X,SIZE>:: deleteFinal()
{
    SizeF--;


}

template <class X , int SIZE> void
Vect <X,SIZE>:: deletePoz(int poz)
{
    int i;
    for(i=poz;i<SizeF-1;i++)
        ZonaFolosita[i]=ZonaFolosita[i+1];
    SizeF--;
}

template <class X, int SIZE> void
Vect <X,SIZE>:: sortare(int left, int right)
{
    //lsort(ZonaFolosita , ZonaFolosita + SizeF);

    int rand;
    int min=left;

    int i = left;
    int j = right;
    int pivot = ZonaFolosita[min];

    while(left<j || i<right)
    {
        while(ZonaFolosita[i]<pivot)
        i++;
        while(ZonaFolosita[j]>pivot)
        j--;

        if(i<=j){
            X aux=ZonaFolosita[i]; ZonaFolosita[i]=ZonaFolosita[j]; ZonaFolosita[j]=aux;
            i++;
            j--;
        }
        else{
            if(left<j)
                sortare(left, j);
            if(i<right)
                sortare(i,right);
            return;
        }
    }
}






template <class X, int SIZE> void
Vect <X,SIZE>:: afisare()
{
    /*cout<<"Dimensiunea Zonei Folosite este: "<<SizeF;
    cout<<"\nDimensiunea Zonei Alocate este: "<<SizeA;
    cout<<"\nElementele Zonei Folosite sunt: ";*/
    for(int i=0;i<SizeF;i++)
        g<<ZonaFolosita[i]<<" ";
    //cout<<endl<<endl;
}

template <class X, int SIZE> void
Vect <X,SIZE>:: cautare(X ob)
{
    int ok=0,i;
    for(i=0;i<SizeF&&ok==0;i++)
        if(ZonaFolosita[i] == ob)
                ok=1;
    if(ok==1)
        cout<<"Elementul este gasit pe pozitia: "<<i-1<<endl;
    else
        cout<<"Elementul nu exista!\n";

}

int main()
{
    Vect<int> p;

    int n;
    f>>n;
    int a;
    for(int i=0;i<n;i++)
    {
        f>>a;
        p.add(a);
    }
    p.sortare(0,n-1);
    p.afisare();



    return 0;
}