#include<iostream>
#include<algorithm>
using namespace std;
int val[10000];
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>val[i];
sort(val,val+n);
int mid=val[n/2];
int lb=lower_bound(val,val+n,mid)-val;
int ub=upper_bound(val,val+n,mid)-val;
if(n-ub==lb)
cout<<mid<<endl;
else
cout<<-1<<endl;
return 0;
}