#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
sort(a, a+n);
int temp = a[n/2];
int l, r;
if(n % 2 == 1)
{
l = r = n / 2;
}
else
{
l = n / 2;
r = n / 2 - 1;
}
for(int i = 0; i < n; i++)
{
if(a[i] == temp && i < n/2)
l--;
if(a[i] == temp && i > n/2)
r--;
}
if(l == r) cout << a[n/2];
else cout << -1;
return 0;
}
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int num;
if(n < 3500) num = n;
if(n > 3500 && n <= 4955) num = (n - 105)*100/97;
if(n > 4955 && n <= 7655) num = (n - 500 + 45)*100/90;
if(n > 7655 && n <= 11255) num = (n - 1600 + 45 +300)*100/80;
if(n > 11255 && n <= 30755) num = (n - 3125 + 45 + 300 + 900)*100/75;
if(n > 30755 && n <= 44755) num = (n- 11550 + 45 + 300 + 900 + 26000*0.25)*100/70;
if(n > 44755 && n <= 61005) num = (n - 58500*0.35 + 45 + 300 + 900 + 26000*0.25 + 20000*0.3)*100/65;
if(n > 61005) num = (n - 83500*0.45 + 45 + 300 + 900 + 26000*0.25 + 20000*0.3 + 25000*0.35)*100/55;
//num = num / 100;
cout << num;
return 0;
}