A11081 | Odds and Ends

Where do odds begin, and where do they end? Where does hope emerge, and will they ever break?

Given an integer sequence $a_{1},a_{2},...,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.

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_{1},a_{2},...,a_{n}$ ( $0<=a_{i}<=100$ ) — the elements of the sequence.

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

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