#include <stdio.h>
void merge(long a[], long s,long e)
{
long mid=(s+e)/2;
long i=s;
long k=s;
long j=mid+1;
long b[1000000];
while(i<=mid && j<=e)
{
if(a[i]<a[j])
b[k++]=a[i++];
else
b[k++]=a[j++];
}
while(i<=mid)
{
b[k++]=a[i++];
}
while(j<=e)
{
b[k++]=a[j++];
}
for(long c=s;c<=e;c++)
a[c]=b[c];
}
void mergesort(long a[], long s, long e)
{
if(s>=e)
return;
long mid=(s + e)/2;
mergesort(a,s,mid);
mergesort(a,mid+1,e);
merge(a,s,e);
}
int main(void) {
long t,a[1000000]={0};
// your code goes here
long h=0,g;
while(h<t)
{
h++;
}
mergesort(a,0,t-1);
for(long d=0; d<t; d++){
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgkKCQoJCQp2b2lkIG1lcmdlKGxvbmcgYVtdLCBsb25nIHMsbG9uZyBlKQoJewoJCWxvbmcgbWlkPShzK2UpLzI7CgkJbG9uZyBpPXM7CgkJbG9uZyBrPXM7CgkJbG9uZyBqPW1pZCsxOwoJCWxvbmcgYlsxMDAwMDAwXTsKCQl3aGlsZShpPD1taWQgJiYgajw9ZSkKCQl7CgkJCWlmKGFbaV08YVtqXSkKCQkJCWJbaysrXT1hW2krK107CgkJCWVsc2UKCQkJCWJbaysrXT1hW2orK107CgkJfQoJCXdoaWxlKGk8PW1pZCkKCQkJewoJCQkJYltrKytdPWFbaSsrXTsKCQkJfQoJCQkKCQl3aGlsZShqPD1lKQoJCQl7CgkJCQliW2srK109YVtqKytdOwoJCQl9CgkJCQoJCWZvcihsb25nIGM9cztjPD1lO2MrKykKCQkJYVtjXT1iW2NdOwoJCQoJfQoJCgkKCQoJCgl2b2lkIG1lcmdlc29ydChsb25nIGFbXSwgbG9uZyBzLCBsb25nIGUpCgl7CgkJaWYocz49ZSkKCQlyZXR1cm47CgkJCgkJbG9uZyBtaWQ9KHMgKyBlKS8yOwoJCQoJCQltZXJnZXNvcnQoYSxzLG1pZCk7CgkJCW1lcmdlc29ydChhLG1pZCsxLGUpOwoJCQltZXJnZShhLHMsZSk7CgkJCgl9CgkKCQppbnQgbWFpbih2b2lkKSB7Cglsb25nIHQsYVsxMDAwMDAwXT17MH07CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglzY2FuZigiJWxkIiwmdCk7Cglsb25nIGg9MCxnOwoJd2hpbGUoaDx0KQoJewoJCQoJCXNjYW5mKCIlbGQiLCZhW2hdKTsKCQloKys7Cgl9CgltZXJnZXNvcnQoYSwwLHQtMSk7CgoJZm9yKGxvbmcgZD0wOyBkPHQ7IGQrKyl7CgkJcHJpbnRmKCIlbGRcbiIsYVtkXSk7fQoKCglyZXR1cm4gMDsKfQo=