#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

typedef pair<ll, ll> p;
int main(int argc, char const *argv[]) {
  ll n;std::cin >> n;
  vector<p> v(3);
  v[0] = p(2, 8);
  v[1] = p(3, 9);
  v[2] = {7, 9};
  for(int i=0;i<n;i++){
    ll a, b, c, d;std::cin >> a >> b >> c >> d;
    for(int j=0;j<3;j++){
      if(v[j].first==a&&v[j].second==b){
        v[j] = {c, d};
      }
    }
  }
  if(v[0]==p(5, 8)&&v[1]==p(4, 8)&&v[2]==p(6, 8)){
    std::cout << "YES" << '\n';
  }else{
    std::cout << "NO" << '\n';
  }
  return 0;
}