#include <stdio.h>
#define SIZE 250000
int a[SIZE], n;
long search_statistics(int l, int r, int k)
{
while (l < r)
{
int i = l, j = r;
int x = a[(r - l) / 2 + l];
while (i <= j)
{
while (a[i] < x) i++;
while (a[j] > x) j--;
if (i <= j)
{
int t = a[i];
a[i++] = a[j];
a[j--] = t;
}
}
if (k <= j)
r = j;
else if (k >= i)
l = i;
else
break;
}
return a[k];
}
int main()
{
int i;
long double res;
for (i = 0; i < n; i++)
if (n % 2)
res = search_statistics(0, n - 1, n / 2);
else
res = ((long double) search_statistics(0, n - 1, n / 2) / 2) + ((long double) search_statistics(0, n - 1, n / 2 - 1) / 2);
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgojZGVmaW5lIFNJWkUgMjUwMDAwCgppbnQgYVtTSVpFXSwgbjsKCmxvbmcgc2VhcmNoX3N0YXRpc3RpY3MoaW50IGwsIGludCByLCBpbnQgaykKewoJd2hpbGUgKGwgPCByKQoJewoJCWludCBpID0gbCwgaiA9IHI7CgkJaW50IHggPSBhWyhyIC0gbCkgLyAyICsgbF07CgoJCXdoaWxlIChpIDw9IGopCgkJewoJCQl3aGlsZSAoYVtpXSA8IHgpIGkrKzsKCgkJCXdoaWxlIChhW2pdID4geCkgai0tOwoKCQkJaWYgKGkgPD0gaikKCQkJewoJCQkJaW50IHQgPSBhW2ldOwoJCQkJYVtpKytdID0gYVtqXTsKCQkJCWFbai0tXSA9IHQ7CgkJCX0KCQl9CgoJCWlmIChrIDw9IGopCgkJCXIgPSBqOwoJCWVsc2UgaWYgKGsgPj0gaSkKCQkJbCA9IGk7CgkJZWxzZQoJCQlicmVhazsKCX0KCglyZXR1cm4gYVtrXTsKfQoKaW50IG1haW4oKQp7CglpbnQgaTsKCWxvbmcgZG91YmxlIHJlczsKCglzY2FuZigiJWQiLCAmbik7CgoJZm9yIChpID0gMDsgaSA8IG47IGkrKykKCQlzY2FuZigiJWQiLCAmYVtpXSk7CgoJaWYgKG4gJSAyKQoJCXJlcyA9IHNlYXJjaF9zdGF0aXN0aWNzKDAsIG4gLSAxLCBuIC8gMik7CgllbHNlCgkJcmVzID0gKChsb25nIGRvdWJsZSkgc2VhcmNoX3N0YXRpc3RpY3MoMCwgbiAtIDEsIG4gLyAyKSAvIDIpICsgKChsb25nIGRvdWJsZSkgc2VhcmNoX3N0YXRpc3RpY3MoMCwgbiAtIDEsIG4gLyAyIC0gMSkgLyAyKTsKCQoJcHJpbnRmKCIlLjFMZiIsIHJlcyk7CgoJcmV0dXJuIDA7Cn0=