#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  vector<vector<pair<int, int> > > ban(9, vector<pair<int, int> >(9, {-1, -1}));
  int n; cin >> n;
  while (n--) {
    int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; --x1; --y1; --x2; --y2;
    if (ban[x1][y1].first == -1) {
      ban[x2][y2] = {x1, y1};
    } else {
      ban[x2][y2] = ban[x1][y1];
    }
  }
  cout << (ban[4][7] == make_pair(1, 7) && ban[3][7] == make_pair(2, 8) && ban[5][7] == make_pair(6, 8) ? "YES\n" : "NO\n");
  return 0;
}