#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    int flag = 0;
    int x1[n],y1[n],x2[n],y2[n];
    rep(i,n)cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];
    rep(i,3){
        int x,y;
        if(i==0){x = 2; y = 8;}
        if(i==1){x = 3; y = 9;}
        if(i==2){x = 7; y = 9;}
        rep(j,n){
            if(x==x1[j]&&y==y1[j]){x = x2[j]; y = y2[j];}
        }
        if(i==0 && (x!=5 || y!=8))flag = 1;
        if(i==1 && (x!=4 || y!=8))flag = 1;
        if(i==2 && (x!=6 || y!=8))flag = 1;
    }
    if(flag == 0)yn;
    return 0;
}