//#include <bits/stdc++.h>
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;//例: VVI dp(10, vector<int>(10, INF);
typedef priority_queue<int, vector<int>, less<int> > QUE_int;
const int INF = 2 * pow(10, 9) + 1;//+1しないとREになるかも(out of rangeになるんかな?? )

vector<int> dx = { -1, 0, 1, 0, -1, -1, 1, 1 };
vector<int> dy = { 0, -1, 0, 1, -1, 1, -1, 1 };

ll max(ll a, ll b) { return (a > b) ? a : b; }
ll min(ll a, ll b) { return (a < b) ? a : b; }

////////////////////////////////////////////////////////////////

// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = pow(10, 9) + 7;
struct mint {
	ll x; // typedef long long ll;
	mint(ll x = 0) :x((x%mod + mod) % mod) {}
	mint operator-() const { return mint(-x); }
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint operator+(const mint a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint a) const {
		mint res(*this);
		return res *= a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const {
		return pow(mod - 2);
	}
	mint& operator/=(const mint a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint a) const {
		mint res(*this);
		return res /= a;
	}
};
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
	vector<mint> fact, ifact;
	combination(int n) :fact(n + 1), ifact(n + 1) {
		assert(n < mod);
		fact[0] = 1;
		for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;
		ifact[n] = fact[n].inv();
		for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;
	}
	mint operator()(int n, int k) {
		if (k < 0 || k > n) return 0;
		return fact[n] * ifact[k] * ifact[n - k];
	}
};


////////////////////////////////////////////////////////////////

int main(void) {
	/*VVI A(3, vector<int>(3));

	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++) {
			cin >> A[i][j];
		}
	}*/
	
	typedef pair<int, bool> P_bool;
	vector<P_bool> A(9);
	
	for (int i = 0; i < 9; i++) {
		int a = 0;
		//cin >> a;
		//cout << a << " ";
		//A[i].first = a;
		cin >> A[i].first;
		A[i].second = false;
		//bool is = false;
		//A[i] = P_bool(a, is);
		
	}

	/*cout << endl;
	for (int i = 0; i < 3; i++) {
		cout << A[i * 3].second << " " << A[i * 3 + 1].second << " " << A[i * 3 + 2].second << endl;
		cout << A[i * 3].first << " " << A[i * 3 + 1].first << " " << A[i * 3 + 2].first << endl;

	}*/
	int N;
	cin >> N;
	vector<int> b(N);
	for (int i = 0; i < N; i++) cin >> b[i];

	
	
	//印をつける
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < 9; j++) {
			if (b[i] == A[j].first) A[j].second = true;
		}
	}


	//ビンゴしてるか確認
	bool ans = false;
	for (int i = 0; i<3; i++) {
		if (A[i].second) {
			if (A[i + 3].second) {
				if (A[i + 6].second) {
					ans = true;
				}
			}
		}
	}

	for (int i = 0; i<3; i++) {
		if (A[i * 3].second) {
			if (A[i * 3 + 1].second) {
				if (A[i * 3 + 2].second) {
					ans = true;
				}
			}
		}
	}

	if (A[0].second) {
		if (A[4].second) {
			if (A[8].second) {
				ans = true;
			}
		}
	}
	if (A[2].second) {
		if (A[4].second) {
			if (A[6].second) {
				ans = true;
			}
		}
	}

	if (ans) {
		cout << "Yes" << endl;
	}
	else cout << "No" << endl;


	for (int i = 0; i < 3; i++) {
		//cout << A[i * 3].second << " " << A[i * 3 + 1].second << " " << A[i * 3 + 2].second << endl;
		//cout << A[i * 3].first << " " << A[i * 3 + 1].first << " " << A[i * 3 + 2].first << endl;
		
	}

}


Measured memory_bytes: 256