【ちょっとづつAtCode】ABC207　D – Congruence Points

n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
xy2 = [list(map(int, input().split())) for _ in range(n)]
def length(s, t):#2次元座標（リスト）＞長さ**2
    return (s[0]-t[0])**2 + (s[1]-t[1])**2

def Cross_product(vector_1, vector_2):#3次元ベクトル（リスト）＞外積（タプル）後で一致を判断したい
    return (vector_1[1]*vector_2[2]-vector_1[2]*vector_2[1], vector_1[2]*vector_2[0]-vector_1[0]*vector_2[2], vector_1[0]*vector_2[1]-vector_1[1]*vector_2[0])

def length_CP(a, b, c):#2次元座標（リスト）＞ac長さ、bc長さ、acとbcの外積（タプル）
    return (length(a, c), length(b, c), Cross_product([c[0]-a[0], c[1]-a[1], 0], [c[0]-b[0], c[1]-b[1], 0]))


if n >= 3:#3点以上で
    for i in range(n):
        for j in range(n):
            if i == j:#非重複順列
                continue
            else:
                if length(xy[0], xy[1]) == length(xy2[i], xy2[j]):
                    xy_set = {length_CP(xy[0], xy[1], xy[k]) for k in range(n)}
                    xy2_set = {length_CP(xy2[i], xy2[j], xy2[k]) for k in range(n)}
                    if xy_set == xy2_set:
                        print('Yes')
                        exit()
                    else:
                        pass
    else:
        print('No')
elif n == 2 and length(xy[0], xy[1]) == length(xy2[0], xy2[1]):
    print('Yes')
elif n == 1:
    print('Yes')
else:
    print('No')