#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll =  long long ;
using P = pair<int,int> ;
const ll INF = 1e14;
const int MOD = 1000000007;

int main(){
    int n;
    cin >> n;
    vector<vector<int>> a(n,vector<int>(4,0));
    rep(i,n)rep(j,4) cin >> a[i][j];
    map<P,P> move ;
    move[P(2,8)] = P(2,8);
    move[P(3,9)] = P(3,9);
    move[P(7,9)] = P(7,9);
    rep(i,n){
        for(auto p:move){
            if(P(a[i][0],a[i][1]) == p.second){
                move[p.first] = P(a[i][2],a[i][3]);
                break;
            }
        }
    }
    if(move[P(2,8)] == P(5,8) && move[P(3,9)] == P(4,8) && move[P(7,9)] == P(6,8)){
        cout << "YES" << endl;
    }else{
        cout << "NO" << endl;
    }
    return 0;
}