import sys sys.setrecursionlimit(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 << 63)-1 # inf = (1 << 31)-1 # md = 10**9+7 md = 998244353 from heapq import * n = II() aa = [0]+LI() q = [] dd = [] for i in range(n): dd.append(aa[i+1]-aa[i]) if dd[-1] & 1 == 0: heappush(q, i) dd.append(0) # print(q, dd) for i in range(n-1): if dd[i] & 1 == 0: continue if dd[i+1] & 1 == 0: d = dd[i] dd[i] -= d dd[i+2] += d else: while q and (q[0] <= i or dd[q[0]] & 1): heappop(q) if not q: print("No") exit() j = q[0] if dd[i+1] & 1 and dd[j+1] & 1: heappush(q, j+1) dd[j] += dd[i] dd[j+1] += dd[i+1] dd[i] = dd[i+1] = 0 # print(q, dd) def ng(si): now = 0 for i in range(si, n, 2): now += dd[i] if now < 0: return True return False print("No" if ng(0) or ng(1) else "Yes")