#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template<typename T> inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

const int SIZE = 120;
int N;
VVI graph(SIZE * SIZE);
int cnt[SIZE * SIZE];
bool dame = false;

PII ip(int n) {
    return MP(n / SIZE, n % SIZE);
}
int pi(PII p) {
    return p.first * SIZE + p.second;
}
int pi(int r, int c) {
    return pi(MP(r, c));
}

set<PII> pre;
void dfs(int now, int prev = -1) {
    if (FIND(pre, MP(now, prev)) || FIND(pre, MP(prev, now))) return;
    //cout<<now<<" "<<prev<<endl;
    cnt[now]++;
    if (cnt[now] >= 2) {
        dame = true;
        return;
    }
    pre.insert(MP(now, prev));
    FORE(e, graph[now]) if (e != prev) {
        dfs(e, now);
    }
}

int main(void) {
    
    memset(cnt, 0, sizeof(cnt));
    scanf("%d", &N);
    REP(i, N) {
        int a, b, c, d;
        scanf("%d%d%d%d", &a, &b, &c, &d);
        a--;b--;c--;d--;
        //cout<<a<<b<<c<<d<<endl;
        graph[pi(a, b)].EB(pi(c, d));
        graph[pi(c, d)].EB(pi(a, b));
    }
    REP(i, SIZE * SIZE) {
        if (cnt[i] == 0) {
            dfs(i);
            pre.clear();
        }
        if (dame) {
            cout << "NO" << endl;
            return 0;
        }
    }
    cout << "YES" << endl;
}