#include <iostream>

using namespace std;
void read()
{
    fin>>n;

    for(int i=1;i<=n;i++)
        fin>>v[i];
}
void mergesort(int st, int dr)
{
    if(dr-st==0)
        return;
    if(dr-st==1)
        if(v[st]>v[dr])
            swap(v[st], v[dr]);

    int mid=st+(dr-st)/2;
    mergesort(st, mid);
    mergesort(mid+1, dr);

    for(int ii=st, jj=mid+1;ii<=)
}
int main()
{
    read();
    mergesort(1, n);
    return 0;
}