#include <bits/stdc++.h>
using namespace std;
const int maxn=1000000+5;
int in[maxn],out[maxn];
void heapify(int arr[], int i, int end) {
int son;
while( (son=2*i+1)<end ){
if( (son+1)<end && arr[son]<arr[son+1] ) son+=1;
if( arr[i]<arr[son] ) swap(arr[i], arr[son]);
i=son;
}
}
void heap_sort(int arr[], int end) {
// build heap
for(int i=end/2; i>=0; i--) {
heapify(arr,i,end);
}
for(int i=end-1, j=0; i>0; i--){
swap(arr[0], arr[i]);
heapify(arr, 0, i);
}
}
int main(int argc, char *argv[]) {
return 0;
}