/*

This Submission is to determine how many 120/240 min const. delivery point there are.

//info
120 req. steps <= 5
*/
#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 1e18
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 1000000007
#define seg_size 262144
#define REP(a,b) for(long long a = 0;a < b;++a)

unsigned long xor128() {
	static unsigned long x = time(NULL), y = 362436069, z = 521288629, w = 88675123;
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
int main() {
	int n;
	cin >> n;
	vector<pair<int, int>> next;
	next.push_back(make_pair(2, 8));
	next.push_back(make_pair(3, 9));
	next.push_back(make_pair(7, 9));
	REP(i, n) {
		int a, b, c, d;
		cin >> a >> b >> c >> d;
		REP(q, 3) {
			if (next[q].first == a && next[q].second == b) {
				next[q] = make_pair(c, d);
			}
		}
	}
	swap(next[0], next[1]);
	int ok = 1;
	for (int j = 0; j < 3; ++j) {
		if (next[j].second != 8 || next[j].first != j + 4) {
			ok = 0;
		}
	}
	if (ok == 0) {
		cout << "NO" << endl;
	}
	else {
		cout << "YES" << endl;
	}
}