#include<stdio.h>
#include<math.h>
void merge(int a[], int l, int m, int r) {
int i; int y ;
for(; l < m && m < r; ++l)
if (!(a[l] < a[m])) {
y = a[m++];
for (i = m - 1; i > l; --i)
a[i] = a[i-1];
a[l] = y;
}
}
void sort1(int a[], int n , int l, int r) {
int m;
if (r - l > 1) {
m = l + (r - l) / 2;
sort1(a,n, l, m);
sort1(a,n, m, r);
merge(a,l, m, r);
}
}
void main(){
int n;
int a[n];
for(int i=0;i<n;i++){
}
//merge sort
sort1(a,n,1,n);
for(int i=0;i<n;i++){
}
}
I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8bWF0aC5oPgp2b2lkIG1lcmdlKGludCBhW10sIGludCBsLCBpbnQgbSwgaW50IHIpIHsKICAgIGludCBpOyBpbnQgeSA7CiAgICBmb3IoOyBsIDwgbSAmJiBtIDwgcjsgKytsKQogICAgICAgIGlmICghKGFbbF0gPCBhW21dKSkgewogICAgICAgICAgICB5ID0gYVttKytdOwogICAgICAgICAgICBmb3IgKGkgPSBtIC0gMTsgaSA+IGw7IC0taSkgCiAgICAgICAgICAgICAgICBhW2ldID0gYVtpLTFdOwogICAgICAgICAgICBhW2xdID0geTsKICAgICAgICB9Cn0KCnZvaWQgc29ydDEoaW50IGFbXSwgaW50IG4gLCBpbnQgbCwgaW50IHIpIHsKICAgIGludCBtOwogICAgaWYgKHIgLSBsID4gMSkgewogICAgICAgIG0gPSBsICsgKHIgLSBsKSAvIDI7CiAgICAgICAgc29ydDEoYSxuLCBsLCBtKTsKICAgICAgICBzb3J0MShhLG4sIG0sIHIpOwogICAgICAgIG1lcmdlKGEsbCwgbSwgcik7CiAgICB9Cn0KCnZvaWQgbWFpbigpewppbnQgbjsKc2NhbmYoIiVkIiwmbik7CmludCBhW25dOwpmb3IoaW50IGk9MDtpPG47aSsrKXsKc2NhbmYoIiVkIiwmYVtpXSk7Cn0KLy9tZXJnZSBzb3J0CnNvcnQxKGEsbiwxLG4pOwpmb3IoaW50IGk9MDtpPG47aSsrKXsKcHJpbnRmKCIlZCAiLGFbaV0pOwp9Cn0=