#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 x = 10;
    int L = 0, R = n - 1;

    while(L <= R) {
        int middle = (L + R) / 2;
        if(x == a[middle]) {
            cout << "YES!" << endl;
            break;
        }

        if(x < a[middle]) {
            R = middle - 1;
        }
        else {
            L = middle + 1;
        }
    }

    return 0;
}