import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
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-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
# md = 998244353
md = 67

p, q = LI()
r, s = LI()
u, v = LI()
x, y = LI()
for a in range(md):
    for b in range(md):
        for c in range(md):
            if (a*p+b*r)%md != (a*u+c*v)%md: continue
            for d in range(md):
                if a*d-b*c == 0: continue
                if (a*q+b*s)%md == (b*u+d*v)%md and (c*p+d*r)%md == (a*x+c*y)%md and (c*q+d*s)%md == (b*x+d*y)%md:
                    print("Yes")
                    exit()

print("No")