// https://atcoder.jp/contests/cf16-exhibition-final-open/tasks/cf16_exhibition_final_b
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define EPS (1e-9)
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define BIT(n) (1LL << (n))
// ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<pii> ans(3);
    ans[0] = {2, 8};
    ans[1] = {3, 9};
    ans[2] = {7, 9};

    REP(i, n) {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        REP(i, 3) {
            if (a == ans[i].first && b == ans[i].second) {
                ans[i] = {c, d};
            }
        }
    }
    if (ans[0] == make_pair(5, 8) && ans[1] == make_pair(4, 8) &&
        ans[2] == make_pair(6, 8)) {
        cout << "YES\n";
    } else {
        cout << "NO\n";
    }

    return 0;
}