#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

int main()
{
    /*
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    */
    vector<int> x(3), y(3);
    x[0] = 2, y[0] = 8;
    x[1] = 3, y[1] = 9;
    x[2] = 7, y[2] = 9;
    int kkt; cin >> kkt;
    while (kkt--) {
        int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
        for (int i = 0; i < 3; i++) {
            if (x[i] == x1 and y[i] == y1) x[i] = x2, y[i] = y2;
        }
    }
    vector<int> ex = { 5,4,6 }, ey = { 8,8,8 };
    if (x == ex and y == ey) puts("YES");
    else puts("NO");
    return 0;
}