#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e18)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))




int main(){
	ll N;
	cin >> N;
	P x[3];
	x[0] = {2,8};
	x[1] = {3,9};
	x[2] = {7,9};

	FOR(i,0,N){
		ll x1,x2,y1,y2;
		cin >> x1 >> y1 >> x2 >> y2;
		FOR(j,0,3){
			if(x[j]==make_pair(x1,y1)){
				x[j] = {x2,y2};
				break;
			}
		}
	}

	bool ans = x[0] == make_pair(5LL,8LL);
	ans = ans&&(x[1]==make_pair(4LL,8LL));
	ans = ans&&(x[2]==make_pair(6LL,8LL));

	if(ans){
		cout << "YES" << endl;
	}else{
		cout << "NO" << endl;
	}

}