#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int Search_Binary(vector <int> arr, int left, int right, int key)
{
    int midd = 0;
    while (true)
    {
        midd = (left + right) / 2;

        if (key < arr[midd])
            right = midd - 1;
        else if (key > arr[midd])
            left = midd + 1;
        else
            return midd;

        if (left > right)
            return -1;
    }
}

int main()
{
    int N;
    cin >> N;
    vector <int> list1(N);
    for (int i = 0; i < N; i++)
    {
        cin >> list1[i];
    }
    sort(list1.begin(), list1.end());
    int n;
    cin >> n;
    vector <int> list2(n);
    for (int i = 0; i < n; i++)
    {
        cin >> list2[i];
    }
    sort(list2.begin(), list2.end());
    for (int i = 0; i < N; i++)
    {
        int key = 10000 - list1[i];
        if (Search_Binary(list2, 0, n-1, key) != -1) {
            cout << "YES"; return 0;
        }
    }
    cout << "NO";