#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001

vector<vector<string>> s(6);
int main(){
	
	s[0] = {};
	int n;
	cin>>n;
	if(n<=1){
		cout<<"NO"<<endl;
		return 0;
	}
	vector<int> a(6);
	rep(i,6)cin>>a[i];
	vector<int> t = {0,1,2};
	bool F = false;
	vector<int> xx = {1,3,4,5},yy = {2,2,2,0};
	do{
		bool f = true;
		rep(i,4){
			int x = xx[i];
			int y = yy[i];

			if(t[a[x]]>=t[a[y]]){
				f=  false;
				break;
			}
		}
		if(t[a[0]]==2&&t[a[1]]==1)f = false;
		if(f)F = true;
	}
	while(next_permutation(t.begin(),t.end()));
	
	if(!F)cout<<"NO"<<endl;
	else{
		dsu D(3);
		rep(i,xx.size()){
			if(i==0)continue;
			D.merge(a[xx[i]],a[yy[i]]);
		}
		int m = 0;
		rep(i,3){
			m = max(m,D.size(i));
		}
		
		if(n==2&&m==3)cout<<"NO"<<endl;
		else cout<<"YES"<<endl;
	}
	
	return 0;
}