/*
ID: gabriel100
LANG: C++
TASK:
*/
#include <cstdio>
#include <algorithm>
//#include <time.h>
#include <queue>
#include <cmath>
#include <stack>
#include <fstream>
#include <bitset>
#include <set>

#define nl '\n'
#define F first
#define S second
#define vi vector<int>
#define all(v) v.begin(),v.end()
#define eb(x) emplace_back(x)
#define ull unsigned long long
#define ll long long
#define ProblemName "algsort"
#define LocalName "data"
#ifdef INFOARENA
#define Filename ProblemName
#else
#define Filename LocalName
#endif
#define Input Filename".in"
#define Output Filename".out"
using namespace std;
ifstream cin(Input);
ofstream cout(Output);
template<class a, class type>
void print(a v, type t) {
    for_each(all(v), [](type x) { cout << x << ' '; });
    cout << nl;
}

#define N 100'001
int n, k;
int v[N];

vector<int> mergeSort(int st, int dr) {
    if(st == dr){
        vector<int> ret({v[st]});
        return ret;
    }
    int mid = (st+dr)>>1;
    vector<int> a = mergeSort(st,mid);
    vector<int> b = mergeSort(mid+1,dr);
    vector<int> ret(a.size()+b.size());
    merge(a.begin(),a.end(),b.begin(),b.end(),ret.begin());
    return ret;
}

int main() {
    ios_base::sync_with_stdio(false);
    //clock_t tStart = clock();
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
    print(mergeSort(0, n-1),1+2-2+1);
    cout.close();
    //printf("\nTime taken: %.2fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
}