B'Where do odds begin, and where do they end? Where does hope emerge, and will they ever break? Given an integer sequence a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an 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, xe2 x80 x894, xe2 x80 x895} and {1} are subsegments of sequence {1, xe2 x80 x892, xe2 x80 x893, xe2 x80 x894, xe2 x80 x895, xe2 x80 x896}, while {1, xe2 x80 x892, xe2 x80 x894} and {7} are not. The first line of input contains a non-negative integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100) -- the length of the sequence. The second line contains n space-separated non-negative integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100) -- 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). In the first example, divide the sequence into 1 subsegment: {1, xe2 x80 x893, xe2 x80 x895} and the requirements will be met. In the second example, divide the sequence into 3 subsegments: {1, xe2 x80 x890, xe2 x80 x891}, {5}, {1}. In the third example, one of the subsegments must start with 4 which is an even number, thus the requirements cannot be met. In the fourth example, the sequence can be divided into 2 subsegments: {3, xe2 x80 x899, xe2 x80 x899}, {3}, but this is not a valid solution because 2 is an even number. '...