PivotOJ

Even More Odd Photos

시간 제한: 1000ms메모리 제한: 512MB출처: USACO 2021 January BronzeBOJ 20974

문제

Farmer John is yet again trying to take a photograph of his NN cows (2N10002 \leq N \leq 1000).

Each cow has an integer "breed ID" number in the range 11001 \ldots 100. Farmer John has a very peculiar idea in mind for his photo: he wants to partition all the cows into disjoint groups (in other words, place each cow in exactly one group) and then line up the groups so the sum of the breed IDs of the cows in the first group is even, the sum of the IDs in the second group is odd, and so on, alternating between even and odd.

What is the maximum possible number of groups Farmer John can form?

입력

The first line of input contains NN. The next line contains NN space-separated integers giving the breed IDs of the NN cows.

출력

The maximum possible number of groups in Farmer John's photo. It can be shown that at least one feasible grouping exists.

예제

예제 1

입력
7
1 3 5 7 9 11 13
출력
3

예제 2

입력
7
11 2 17 13 1 15 3
출력
5
코드를 제출하려면 로그인하세요.