#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y, long long md = 1000) {
  long long res = 1;
  x %= md;
  while (y > 0) {
    if (y & 1) res = (res * x) % md;
    x = (x * x) % md;
    y = y >> 1;
  }
  return res % md;
}
long long seg[400005][2];
pair<long long, long long> query(long long index, long long ss, long long se,
                                 long long qs, long long qe) {
  if (qs > qe) return {1000000000000000000, -1000000000000000000};
  if (ss >= qs && se <= qe) {
    return {seg[index][0], seg[index][1]};
  }
  if (ss > qe || se < qs) return {1000000000000000000, -1000000000000000000};
  long long mid = (ss + se) / 2;
  pair<long long, long long> a = query(index * 2 + 1, ss, mid, qs, qe);
  pair<long long, long long> b = query(index * 2 + 2, mid + 1, se, qs, qe);
  return {min(a.first, b.first), max(a.second, b.second)};
}
void update(long long index, long long ss, long long se, long long loc,
            pair<long long, long long> val) {
  if (ss > loc || se < loc) return;
  if (ss == se) {
    seg[index][0] = val.second;
    seg[index][1] = val.first;
    return;
  }
  long long mid = (ss + se) / 2;
  update(index * 2 + 1, ss, mid, loc, val);
  update(index * 2 + 2, mid + 1, se, loc, val);
  seg[index][0] = min(seg[index * 2 + 1][0], seg[index * 2 + 2][0]);
  seg[index][1] = max(seg[index * 2 + 1][1], seg[index * 2 + 2][1]);
}
bool cmp(pair<pair<long long, long long>, pair<long long, long long>> a,
         pair<pair<long long, long long>, pair<long long, long long>> b) {
  return a.first.second < b.first.second;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long n;
  cin >> n;
  long long first = 1;
  vector<pair<pair<long long, long long>, pair<long long, long long>>> v(n);
  for (long long i = 0; i < n; i++) {
    cin >> v[i].first.first >> v[i].first.second >> v[i].second.first >>
        v[i].second.second;
  }
  vector<pair<pair<long long, long long>, pair<long long, long long>>> back = v;
  sort(v.begin(), v.end(), cmp);
  for (long long i = 0; i < n; i++) {
    update(0, 0, n - 1, i, {v[i].second.first, v[i].second.second});
  }
  vector<long long> ends;
  for (long long i = 0; i < n; i++) {
    long long num =
        ends.end() - lower_bound(ends.begin(), ends.end(), v[i].first.first);
    ends.push_back(v[i].first.second);
    if (num == 0) continue;
    pair<long long, long long> q = query(0, 0, n - 1, i - num, i - 1);
    long long l = q.second;
    long long r = q.first;
    if (r < v[i].second.first || l > v[i].second.second) first = 0;
  }
  v = back;
  for (long long i = 0; i < n; i++) swap(v[i].first, v[i].second);
  sort(v.begin(), v.end(), cmp);
  for (long long i = 0; i < n; i++) {
    update(0, 0, n - 1, i, {v[i].second.first, v[i].second.second});
  }
  ends.clear();
  for (long long i = 0; i < n; i++) {
    long long num =
        ends.end() - lower_bound(ends.begin(), ends.end(), v[i].first.first);
    ends.push_back(v[i].first.second);
    if (num == 0) continue;
    pair<long long, long long> q = query(0, 0, n - 1, i - num, i - 1);
    long long l = q.second;
    long long r = q.first;
    if (r < v[i].second.first || l > v[i].second.second) first = 0;
  }
  if (first)
    cout << "YES";
  else
    cout << "NO";
}

### Prompt

Please create a solution in cpp to the following problem:

Filled with optimism, Hyunuk will host a conference about how great this new year will be!

The conference will have n lectures. Hyunuk has two candidate venues a and b. For each of the n lectures, the speaker specified two time intervals [sa_i, ea_i] (sa_i ≤ ea_i) and [sb_i, eb_i] (sb_i ≤ eb_i). If the conference is situated in venue a, the lecture will be held from sa_i to ea_i, and if the conference is situated in venue b, the lecture will be held from sb_i to eb_i. Hyunuk will choose one of these venues and all lectures will be held at that venue.

Two lectures are said to overlap if they share any point in time in common. Formally, a lecture held in interval [x, y] overlaps with a lecture held in interval [u, v] if and only if max(x, u) ≤ min(y, v).

We say that a participant can attend a subset s of the lectures if the lectures in s do not pairwise overlap (i.e. no two lectures overlap). Note that the possibility of attending may depend on whether Hyunuk selected venue a or venue b to hold the conference.

A subset of lectures s is said to be venue-sensitive if, for one of the venues, the participant can attend s, but for the other venue, the participant cannot attend s.

A venue-sensitive set is problematic for a participant who is interested in attending the lectures in s because the participant cannot be sure whether the lecture times will overlap. Hyunuk will be happy if and only if there are no venue-sensitive sets. Determine whether Hyunuk will be happy.

Input

The first line contains an integer n (1 ≤ n ≤ 100 000), the number of lectures held in the conference.

Each of the next n lines contains four integers sa_i, ea_i, sb_i, eb_i (1 ≤ sa_i, ea_i, sb_i, eb_i ≤ 10^9, sa_i ≤ ea_i, sb_i ≤ eb_i).

Output

Print "YES" if Hyunuk will be happy. Print "NO" otherwise.

You can print each letter in any case (upper or lower).

Examples

Input


2
1 2 3 6
3 4 7 8


Output


YES


Input


3
1 3 2 4
4 5 6 7
3 4 5 5


Output


NO


Input


6
1 5 2 9
2 4 5 8
3 6 7 11
7 10 12 16
8 11 13 17
9 12 14 18


Output


YES

Note

In second example, lecture set \{1, 3\} is venue-sensitive. Because participant can't attend this lectures in venue a, but can attend in venue b.

In first and third example, venue-sensitive set does not exist.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y, long long md = 1000) {
  long long res = 1;
  x %= md;
  while (y > 0) {
    if (y & 1) res = (res * x) % md;
    x = (x * x) % md;
    y = y >> 1;
  }
  return res % md;
}
long long seg[400005][2];
pair<long long, long long> query(long long index, long long ss, long long se,
                                 long long qs, long long qe) {
  if (qs > qe) return {1000000000000000000, -1000000000000000000};
  if (ss >= qs && se <= qe) {
    return {seg[index][0], seg[index][1]};
  }
  if (ss > qe || se < qs) return {1000000000000000000, -1000000000000000000};
  long long mid = (ss + se) / 2;
  pair<long long, long long> a = query(index * 2 + 1, ss, mid, qs, qe);
  pair<long long, long long> b = query(index * 2 + 2, mid + 1, se, qs, qe);
  return {min(a.first, b.first), max(a.second, b.second)};
}
void update(long long index, long long ss, long long se, long long loc,
            pair<long long, long long> val) {
  if (ss > loc || se < loc) return;
  if (ss == se) {
    seg[index][0] = val.second;
    seg[index][1] = val.first;
    return;
  }
  long long mid = (ss + se) / 2;
  update(index * 2 + 1, ss, mid, loc, val);
  update(index * 2 + 2, mid + 1, se, loc, val);
  seg[index][0] = min(seg[index * 2 + 1][0], seg[index * 2 + 2][0]);
  seg[index][1] = max(seg[index * 2 + 1][1], seg[index * 2 + 2][1]);
}
bool cmp(pair<pair<long long, long long>, pair<long long, long long>> a,
         pair<pair<long long, long long>, pair<long long, long long>> b) {
  return a.first.second < b.first.second;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long n;
  cin >> n;
  long long first = 1;
  vector<pair<pair<long long, long long>, pair<long long, long long>>> v(n);
  for (long long i = 0; i < n; i++) {
    cin >> v[i].first.first >> v[i].first.second >> v[i].second.first >>
        v[i].second.second;
  }
  vector<pair<pair<long long, long long>, pair<long long, long long>>> back = v;
  sort(v.begin(), v.end(), cmp);
  for (long long i = 0; i < n; i++) {
    update(0, 0, n - 1, i, {v[i].second.first, v[i].second.second});
  }
  vector<long long> ends;
  for (long long i = 0; i < n; i++) {
    long long num =
        ends.end() - lower_bound(ends.begin(), ends.end(), v[i].first.first);
    ends.push_back(v[i].first.second);
    if (num == 0) continue;
    pair<long long, long long> q = query(0, 0, n - 1, i - num, i - 1);
    long long l = q.second;
    long long r = q.first;
    if (r < v[i].second.first || l > v[i].second.second) first = 0;
  }
  v = back;
  for (long long i = 0; i < n; i++) swap(v[i].first, v[i].second);
  sort(v.begin(), v.end(), cmp);
  for (long long i = 0; i < n; i++) {
    update(0, 0, n - 1, i, {v[i].second.first, v[i].second.second});
  }
  ends.clear();
  for (long long i = 0; i < n; i++) {
    long long num =
        ends.end() - lower_bound(ends.begin(), ends.end(), v[i].first.first);
    ends.push_back(v[i].first.second);
    if (num == 0) continue;
    pair<long long, long long> q = query(0, 0, n - 1, i - num, i - 1);
    long long l = q.second;
    long long r = q.first;
    if (r < v[i].second.first || l > v[i].second.second) first = 0;
  }
  if (first)
    cout << "YES";
  else
    cout << "NO";
}

```