import sys

# sys.setrecursionlimit(1000005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

def ok():
    start = [(1, 7), (2, 8), (6, 8)]
    goal = [(4, 7), (3, 7), (5, 7)]
    board = [[-1]*9 for _ in range(9)]

    for i, (x, y) in enumerate(start):
        board[x][y] = i

    n = II()
    for _ in range(n):
        x, y, s, t = LI1()
        board[x][y], board[s][t] = board[s][t], board[x][y]

    for i, (x, y) in enumerate(goal):
        if board[x][y] != i: return False

    return True

print("YES" if ok() else "NO")