// includes #include // macros #define ll long long int #define pb emplace_back #define mk make_pair #define pq priority_queue #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr) #define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr) #define vrep(v, i) for(int i = 0; i < (v).size(); i++) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define FI first #define SE second #define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n]; #define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m]; #define bit(n) (1LL<<(n)) #define INT(n) int n; cin >> n; #define LL(n) ll n; cin >> n; #define DOUBLE(n) double n; cin >> n; using namespace std; template bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} template istream &operator>>(istream &is, vector &vec){for(auto &v: vec)is >> v; return is;} template ostream &operator<<(ostream &os, const vector& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;} template ostream &operator<<(ostream &os, const set& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const unordered_set& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const multiset& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const unordered_multiset& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const pair &p){os << p.first << " " << p.second; return os;} template ostream &operator<<(ostream &os, const map &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} template ostream &operator<<(ostream &os, const unordered_map &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} // types typedef pair P; typedef pair Pl; typedef pair Pll; typedef pair Pd; typedef complex cd; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1e9 + 7; const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, -1, 0, 1}; typedef struct UnionFind_ { vector par; vector rank_; UnionFind_(){} explicit UnionFind_(int n): rank_(n, 0) { par.resize(n); for(int i = 0; i < n; i++)par[i] = i; } int find(int x) { if(par[x] == x)return x; else return par[x] = find(par[x]); } bool same(int x, int y) { if(find(x) == find(y))return true; else return false; } bool unite(int x, int y){ int xp = find(x); int yp = find(y); if(xp == yp)return false; if(rank_[xp] > rank_[yp])par[yp] = xp; else if(rank_[xp] < rank_[yp])par[xp] = yp; else { par[yp] = xp; rank_[xp]++; } return true; } } UnionFind; // solve int n; vector c1, c2, r1, r2; vector v[112][112]; bool vis[112][112]; int main(int argc, char const* argv[]) { ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20); cin >> n; r1.resize(n); c1.resize(n); r2.resize(n); c2.resize(n); rep(i, n)cin >> r1[i] >> c1[i] >> r2[i] >> c2[i]; rep(i, n){ v[r1[i]][c1[i]].pb(i); v[r2[i]][c2[i]].pb(i); } UnionFind uf(n); rep(i, n){ rep(j, n){ rep(k, sz(v[i][j])){ FOR(l, k + 1, sz(v[i][j])){ uf.unite(v[i][j][k], v[i][j][l]); } } } } rep(i, n){ int e = 0; set

st; rep(j, n){ if(uf.find(j) == i){ e++; st.insert(mk(r1[j], c1[j])); st.insert(mk(r2[j], c2[j])); } } if(e > st.size()){ cout << "NO" << endl; return 0; } } cout << "YES" << endl; return 0; }