#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int)1e9 + 23111992;
const long long LINF = (long long)1e18 + 23111992;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline unsigned long long isqrt(unsigned long long k) {
  unsigned long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int mrand() { return abs((int)mt()); }
void chemthan() {
  int n;
  cin >> n;
  vector<int> a(n), b(n), c(n), d(n);
  for (int i = (0); i < (n); ++i) cin >> a[i] >> b[i] >> c[i] >> d[i];
  int ok = 1;
  function<void(set<pair<int, int> >&, set<pair<int, int> >&,
                set<pair<int, int> >&, set<pair<int, int> >&)>
      rec = [&](set<pair<int, int> >& sa, set<pair<int, int> >& sb,
                set<pair<int, int> >& sc, set<pair<int, int> >& sd) {
        int k = int((sa).size());
        if (k == 1) {
          return;
        }
        auto sa_b = sa.begin();
        sa_b++;
        auto sc_b = sc.begin();
        auto sa_e = sa.end();
        sa_e--;
        auto sc_e = sc.end();
        sc_e--, sc_e--;
        auto sb_b = sb.begin();
        sb_b++;
        auto sd_b = sd.begin();
        auto sb_e = sb.end();
        sb_e--;
        auto sd_e = sd.end();
        sd_e--, sd_e--;
        int t = -1, cc = -1;
        for (int i = 0; i + i < k - 1; i++) {
          if (sc_b->first <= sa_b->first) {
            t = 0, cc = i + 1;
            break;
          }
          if (sc_e->first <= sa_e->first) {
            t = 1, cc = i + 1;
            break;
          }
          if (sd_b->first <= sb_b->first) {
            t = 2, cc = i + 1;
            break;
          }
          if (sd_e->first <= sb_e->first) {
            t = 3, cc = i + 1;
            break;
          }
          if ((i + 1) + (i + 1) < k - 1) {
            sa_b++, sc_b++, sa_e--, sc_e--;
            sb_b++, sd_b++, sb_e--, sd_e--;
          }
        }
        if (t == -1) {
          ok = 0;
          return;
        }
        vector<int> ver;
        if (t == 0) {
          auto it = sc.begin();
          for (int i = (0); i < (cc); ++i) {
            ver.push_back(it->second);
            it++;
          }
        }
        if (t == 1) {
          auto it = sa.end();
          it--;
          for (int i = (0); i < (cc); ++i) {
            ver.push_back(it->second);
            it--;
          }
        }
        if (t == 2) {
          auto it = sd.begin();
          for (int i = (0); i < (cc); ++i) {
            ver.push_back(it->second);
            it++;
          }
        }
        if (t == 3) {
          auto it = sb.end();
          it--;
          for (int i = (0); i < (cc); ++i) {
            ver.push_back(it->second);
            it--;
          }
        }
        set<pair<int, int> > sa2, sb2, sc2, sd2;
        for (int ix : ver) {
          sa.erase(make_pair(a[ix], ix));
          sb.erase(make_pair(b[ix], ix));
          sc.erase(make_pair(c[ix], ix));
          sd.erase(make_pair(d[ix], ix));
          sa2.insert(make_pair(a[ix], ix));
          sb2.insert(make_pair(b[ix], ix));
          sc2.insert(make_pair(c[ix], ix));
          sd2.insert(make_pair(d[ix], ix));
        }
        rec(sa, sb, sc, sd);
        rec(sa2, sb2, sc2, sd2);
      };
  set<pair<int, int> > sa, sb, sc, sd;
  for (int i = (0); i < (n); ++i) {
    sa.insert(make_pair(a[i], i));
    sb.insert(make_pair(b[i], i));
    sc.insert(make_pair(c[i], i));
    sd.insert(make_pair(d[i], i));
  }
  rec(sa, sb, sc, sd);
  if (ok) {
    cout << "YES\n";
  } else {
    cout << "NO\n";
  }
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
