#include <bits/stdc++.h> 
using namespace std;

typedef long long ll;
#define pa pair<int, int> 
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair 
#define COUT(v) for(int64_t i=0;i<(v).size();i++){ cout << v.at(i) << endl;}
#define REP(i, n) for(int64_t i=0;i<n;i++)
#define REPk(i, k, n) for(int64_t i=k;i<n;i++)

#define VIN(v) for(int64_t i=0;i<(v).size();i++){cin >> (v).at(i);}

typedef vector<bool> bvec;
typedef vector<int> ivec;
typedef vector<long long> lvec;
typedef vector<double> dvec;
typedef vector<pa> pavec;
typedef vector<pali> palivec;
typedef vector<pal>palvec;


typedef vector< vector<bool> > bmat;
typedef vector< vector<int> > imat;
typedef vector< vector<long long> > lmat;

typedef vector<string> svec;
typedef vector< vector<string> > smat;
const ll infll = (1LL << 60) - 1;
const int inf = (1 << 30) - 1;
const int MOD = 1000000007;


ll gcd(ll x, ll y){
    ll r = x%y;
    if(r == 0) return y;
    else return gcd(y, r);
} 

ll lcm(ll x, ll y){
    return x*y/gcd(x,y);
}

lvec mfactor(ll n){
    bvec ip(n, true);
    lvec mf(n, -1);
    ip[0]=false; ip[1]=false; mf[0]=0; mf[1]=1;
    REP(i, n){
        if(ip[i]){
            mf[i] = i;
            for(ll j=i*i; j<n; j+=i){
                ip[j] = false;
                if(mf[j] == -1) mf[j]=i;
            }
        }
    }
    return mf;
}

palivec get_prime(ll n, const lvec &mf){
    palivec plist;
    while(n != 1){
        int cnt=0;
        ll m=mf[n];
        while(mf[n] == m){
            cnt++;
            n/=m;
        }
        plist.pb(pali(m, cnt));
    }
    return plist;
}

void COMinit(int m, lvec &fac, lvec &finv){
    lvec inv(m);
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < m; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

ll COM(int n, int k, const lvec& fac, const lvec &finv){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}


ll modinv(ll a, ll m) {
    ll b = m, u = 1, v = 0;
    while (b) {
        ll t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}

ll powmod(ll x, ll n){
    ll res=1;
    while(n>0){
        if(n&1) res = res*x%MOD;
        x = x*x%MOD;
        n>>=1;
    }
    return res;
}

void perm1(int pos, int n, ivec &used, ivec &perm){
    if(pos==n){
        for (auto v: perm){
            cout << v << ' ';
        }
        cout << endl;
    }
    for (int i = 0; i < n; i++)
    {
        if(!used[i]) {
            used[i] = true;
            perm[pos] = i;
            perm1(pos+1, n, used, perm);
            used[i] = false;
        }
    }
    return;    
}


int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    imat a(3, ivec(3));
    REP(i, 3) REP(j, 3) cin >> a[i][j];
    cin >> n;
    REP(i, n){
        int b;
        cin >> b;
        REP(j, 3){
            REP(k, 3){
               if(a[j][k]==b) a[j][k] = -1;
            }
        }
    }
    REP(i, 3){
        int cnt=0;
        REP(j, 3){
            if(a[i][j]==-1) cnt++;
        }
        if(cnt==3){
            cout << "Yes" << endl;
            return 0;
        }
    }
    REP(i, 3){
        int cnt=0;
        REP(j, 3){
            if(a[j][i]==-1) cnt++;
        }
        if(cnt==3){
            cout << "Yes" << endl;
            return 0;
        }
    }
    int cnt1=0, cnt2=0;
    REP(i, 3){
        if(a[i][i] == -1) cnt1++;
        if(a[i][2-i] == -1)cnt2++;
    }
    if(cnt1==3 || cnt2==3) cout << "Yes" << endl;
    else cout <<"No" <<endl;
    
}




Measured memory_bytes: 256