#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N = 2e5 + 10;
int a[N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a+1,a+1+n);
int ans=-1;
for(int i=1;i<=n;i++){
int x=lower_bound(a+1,a+1+n,a[i])-a;
int y=upper_bound(a+1,a+1+n,a[i])-a;
if(y-x>n/2){
ans=a[i];
break;
}
}
if(ans == -1)
cout<<"no";
else cout<<ans;
return 0;
}