#include<stdio.h>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <stdio.h>
using namespace std;
int main()
{
int a[1000];
int n;
scanf("%d",&n);
for(int i=0; i<n; i++)
scanf("%d",&a[i]);
int x;
scanf("%d",&x);
sort(a,a+n);
int l=0,r=n;
int flag =0;
while(r>l)
{
if(x==a[(l+r)/2])
{
flag = 1;
break;
}
else if(x<a[(l+r+1)/2])
r=(l+r)/2;
else
l=(l+r)/2;
}
if(flag)
printf("YES");
else
printf("NO");
return 0;
}
while (left <= right) {
int mid = (left + right) / 2;
if (array[mid] == key) {
return mid;
}
else if (array[mid] < key) {
left = mid + 1;
}
else {
right = mid - 1;
}
}