Odds and Ends

Given an integer sequence a₁, a₂, ..., a_n of length n. Decide whether it is possible to divide it into an odd number of non-empty subsegments, the each of which has an odd length and begins and ends with odd numbers.

A subsegment is a contiguous slice of the whole sequence. For example, {3, 4, 5} and {1} are subsegments of sequence {1, 2, 3, 4, 5, 6}, while {1, 2, 4} and {7} are not.

Input

The first line of input contains a non-negative integer n (1 ≤ n ≤ 100) — the length of the sequence.

The second line contains n space-separated non-negative integers a₁, a₂, ..., a_n (0 ≤ a_i ≤ 100) — the elements of the sequence.

Output

Output "Yes" if it's possible to fulfill the requirements, and "No" otherwise.

You can output each letter in any case (upper or lower).

Examples

Input

3
1 3 5

Output

Yes

Input

5
1 0 1 5 1

Output

Yes

Input

3
4 3 1

Output

No

Input

4
3 9 9 3

Output

No

Solution

n = int(input())

s = list(map(int, input().split()))

c1 = s[0] % 2 == 1

c2 = s[-1] % 2 == 1

c3 = n % 2 == 1

if c1 and c2 and c3:

print("Yes")

else:

print("No")

Comments