#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)

typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
typedef pair<int, double> Pid;
typedef pair<double, int> Pdi;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<int, pair<int, int>> PP;
typedef pair<P, int> PPi;
constexpr double PI = 3.1415926535897932;   // acos(-1)
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1e+9 + 7;
// constexpr int mod = 998244353;

vector<vector<int>> board(15, vector<int>(15, -1));

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    board[7][9] = 0;
    board[3][9] = 1;
    board[2][8] = 2;
    int k = 3;
    for(int i = 0; i < n; ++i){
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        if(board[x1][y1] == -1) board[x1][y1] = k++;
        board[x2][y2] = board[x1][y1];
        board[x1][y1] = -1;
    }
    // cerr << board[6][8] << " " << board[4][8] << " " << board[5][8] << endl;
    if(board[6][8] == 0 && board[4][8] == 1 && board[5][8] == 2){
        cout << "YES\n";
    }
    else    cout << "NO\n";
}