#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if __cplusplus >= 201103L #include #include #include #include #include #include #include #include #include #include #include #endif #define F first #define S second #define MP make_pair #define pb push_back #define all(a) a.begin(), a.end() #define lcm( a, b ) (a)/__gcd((a),(b))*(b) #define endl '\n' using namespace std; typedef long long LL; typedef pair< int, int > P; typedef pair< LL, LL > LP; typedef pair< int, P > iP; typedef pair< P, P > PP; static const int INF = INT_MAX; static const LL LINF = LLONG_MAX; static const int MIN = INT_MIN; static const LL LMIN = LLONG_MIN; static const int MOD = 1000000007; static const int SIZE = 100005; const int dx[] = {0, -1, 1, 0}; const int dy[] = {-1, 0, 0, 1}; vector< int > Div( int n ) { vector< int > ret; for( int i = 1; i * i <= n; ++i ) { if( n % i == 0 ) { ret.pb( i ); if( i * i != n ) ret.pb( n / i ); } } sort( all( ret ) ); return ret; } int main() { ios::sync_with_stdio(false); cin.tie(0); int mp[10][10] = {}; int n; cin >> n; mp[8][2] = 1; mp[9][3] = 2; mp[9][7] = 3; for( int i = 0; i < n; ++i ) { int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; mp[y2][x2] = mp[y1][x1]; mp[y1][x1] = 0; } if( mp[8][5] == 1 && mp[8][4] == 2 && mp[8][6] == 3 ) { cout << "YES"; } else { cout << "NO"; } cout << endl; return 0; }