/**
	author:  shobonvip
	created: 2024.11.11 03:49:50
**/

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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	map<pair<int,int>,char> st;
	int n; cin >> n;
	st[pair(2, 8)]='A';
	st[pair(3, 9)]='B';
	st[pair(7, 9)]='C';
	rep(i,0,n) {
		int x1, y1, x2, y2; 
		cin >> x1 >> y1 >> x2 >> y2;
		if (x1==x2 && y1==y2) continue;
		st[pair(x2,y2)] = st[pair(x1,y1)];
		st.erase(pair(x1,y1));
	}

	if (st[pair(5,8)] != 'A') {
		cout << "NO\n";
		return 0;
	}
	if (st[pair(4,8)] != 'B') {
		cout << "NO\n";
		return 0;
	}
	if (st[pair(6,8)] != 'C') {
		cout << "NO\n";
		return 0;
	}
	cout << "YES\n";
}