from math import *
from itertools import combinations,accumulate
from collections import defaultdict,deque,Counter
from heapq import heapify,heappush,heappop
from bisect import bisect,insort


def II(): return int(input())
def LI(): return list(map(int,input().split()))
def matrix1(n1,v):return [v for _ in range(n1)]
def matrix2(n1,n2,v):return [matrix1(n2,v) for _ in range(n1)]
def matrix3(n1,n2,n3,v):return [matrix2(n2,n3,v) for _ in range(n1)]
def matrix4(n1,n2,n3,n4,v):return [matrix3(n2,n3,n4,v) for _ in range(n1)]
#def inside(i, j):return 0<=i<h and 0<=j<w
dir={"U":(-1,0),"D":(1,0),"L":(0,-1),"R":(0,1)}

n = II()
a = [input() for _ in range (n)]
if n % 2 == 0:
    cnt = 0
    for e in  a:
        cnt += e.count("#")
    if cnt % 2 == 0:
        print("Yes")
    else:
        print("No")
else:
    print("Yes")