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


/// File input & output /////
#define fRead(x)        freopen("x.txt","r",stdin)
#define fWrite(x)       freopen ("x.txt","w",stdout)

#define mt              make_tuple
#define ld              long double
#define ll              long long
#define ull             unsigned long long
#define ff              first
#define ss              second
#define pb              push_back
#define INF             2e16
#define PI              acos(-1.0)
#define mp              make_pair
#define pii             pair<int,int>
#define pll             pair<LL,LL>


#define min3(a,b,c)     min(a,min(b,c))
#define max3(a,b,c)     max(a,max(b,c))
#define min4(a,b,c,d)   min(a,min(b,min(c,d)))
#define max4(a,b,c,d)   max(a,max(b,max(c,d)))
#define SQR(a)          ((a)*(a))
#define FOR(i,a,b)      for(int i=a;i<=b;i++)
#define ROF(i,a,b)      for(int i=a;i>=b;i--)
#define REP(i,b)        for(int i=0;i<b;i++)
#define MEM(a,x)        memset(a,x,sizeof(a))
#define ABS(x)          ((x)<0?-(x):(x))

#define SORT(v)         sort(v.begin(),v.end())
#define REV(v)          reverse(v.begin(),v.end())


#define FASTIO        ios_base::sync_with_stdio(0);cin.tie(nullptr);




///..................Sort by second element in a pair in decending order............. ///
bool SortbySecDesc(const pair<long long,long long > &a, const pair<long long,long long > &b)
{
    return a.second>b.second;
}

///.........................first element of pair in descending order..........................//////
bool sortinrev(const pair<int,int> &a,
               const pair<int,int> &b)
{
       return (a.first > b.first);
}



///.............................................................TEMPLATE................................................./////

int main()
{
    FASTIO;

    int a[10][10];


    for(int i=0; i<3; i++)
    {
        for(int j=0; j<3; j++)
        {
            cin >> a[i][j];
        }
    }


    int n;


    cin >> n;

    for(int i=0; i<n; i++)
    {

        int a1;

        cin >> a1;


        for(int j=0; j<3; j++)
        {
            for(int k=0; k<3; k++)
            {
                if(a[j][k]==a1)
                {
                    a[j][k] = 0;

                }
            }
        }
    }


    int count = 0;

    for(int i=0; i<3; i++)
    {
        if(a[0][i]==0)
            count++;
    }

    if(count==3)
    {
        cout << "Yes" << endl;
        return 0;
    }



    int count1 = 0;

    for(int i=0; i<3; i++)
    {
        if(a[1][i]==0)
            count1++;
    }

    if(count1==3)
    {
        cout << "Yes" << endl;
        return 0;
    }


    int count2 = 0;

    for(int i=0; i<3; i++)
    {
        if(a[2][i]==0)
            count2++;
    }

    if(count2==3)
    {
        cout << "Yes" << endl;
        return 0;
    }


    int count3 = 0;

    for(int i=0; i<3; i++)
    {
        if(a[i][0]==0)
            count3++;
    }

    if(count3==3)
    {
        cout << "Yes" << endl;
        return 0;
    }


    int count4 = 0;

    for(int i=0; i<3; i++)
    {
        if(a[i][1]==0)
            count4++;
    }

    if(count4==3)
    {
        cout << "Yes" << endl;
        return 0;
    }


    int count5 = 0;

    for(int i=0; i<3; i++)
    {
        if(a[i][2]==0)
            count5++;
    }

    if(count5==3)
    {
        cout << "Yes" << endl;
        return 0;
    }

    if(a[0][0]==0 && a[1][1]==0 && a[2][2]==0)
    {
        cout << "Yes" << endl;
        return 0;
    }

    if(a[0][2]==0 && a[1][1]==0 && a[2][0]==0)
    {
        cout << "Yes" << endl;
        return 0;
    }

    cout << "No" << endl;











    return 0;
}



Measured memory_bytes: 256