#include <bits/stdc++.h>
#define range(i, l, r) for(long long int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    if (v.size() == 0) return os << "]";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    os << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        os << ", " << *it;
    }
    return os << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    os << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        os << ", " << *it;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    os << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        os << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    os << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        os << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
    lint res = 1;
    lint cur_num = num;
    while (e) {
        if (e & 1) {
            res *= cur_num;
            res %= MOD;
        }
        cur_num *= cur_num;
        cur_num %= MOD;
        e >>= 1;
    }
    return res;
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    unordered_map<lint, plint> number;
    range(i, 0, 3) range(j, 0, 3) {
        lint A; cin >> A;
        number[A] = {i, j};
    }
    lint N; cin >> N;
    vec<vec<bool>> marked(3, vec<bool>(3, false));
    range(i, 0, N) {
        lint b; cin >> b;
        if (number.count(b)) {
            lint i, j; tie(i, j) = number.at(b);
            marked.at(i).at(j) = true;
        }
    }
    range(i, 0, 3) {
        lint num_marked = 0;
        range(j, 0, 3) num_marked += marked.at(i).at(j);
        if (num_marked == 3) {
            cout << "Yes" << "\n";
            return 0;
        }
    }
    range(j, 0, 3) {
        lint num_marked = 0;
        range(i, 0, 3) num_marked += marked.at(i).at(j);
        if (num_marked == 3) {
            cout << "Yes" << "\n";
            return 0;
        }
    }
    lint num_marked = 0;
    range(k, 0, 3) num_marked += marked.at(k).at(k);
    if (num_marked == 3) {
        cout << "Yes" << "\n";
        return 0;
    }
    num_marked = 0;
    range(k, 0, 3) num_marked += marked.at(k).at(2 - k);
    if (num_marked == 3) {
        cout << "Yes" << "\n";
        return 0;
    }
    cout << "No" << "\n";
}

Measured memory_bytes: 256