A flower shop has got *n* bouquets, and the *i*-th bouquet consists of *a*<sub class="lower-index">*i*</sub> flowers. Vasya, the manager of the shop, decided to make large bouquets from these bouquets. 

Vasya thinks that a bouquet is large if it is made of two or more initial bouquets, and there is a constraint: the total number of flowers in a large bouquet should be odd. Each of the initial bouquets can be a part of at most one large bouquet. If an initial bouquet becomes a part of a large bouquet, all its flowers are included in the large bouquet.

Determine the maximum possible number of large bouquets Vasya can make.
The first line contains a single positive integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>) — the number of initial bouquets.

The second line contains a sequence of integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">6</sup>) — the number of flowers in each of the initial bouquets.
In the first example Vasya can make 2 large bouquets. For example, the first bouquet can contain the first and the fifth initial bouquets (the total number of flowers is then equal to 9), and the second bouquet can consist of the second and the third initial bouquets (the total number of flowers is then equal to 7). The fourth initial bouquet is unused in this scheme. 

In the second example it is not possible to form a single bouquet with odd number of flowers.

In the third example Vasya can make one large bouquet. For example, he can make it using all three initial bouquets. The size of the large bouquet is then equal to 11 + 4 + 10 = 25.
5
2 3 4 2 7
2
6
2 2 6 8 6 12
0
3
11 4 10
1
1
1
0
1
2
0
1
999999
0
1
1000000
0
4
943543 151729 379602 589828
2
2
468463 62253
0
3
352987 849349 967007
1
20
274039 899325 798709 157662 963297 276599 529230 80095 252956 980560 358150 82383 29856 901568 123794 275349 512273 508369 120076 170206
10
25
742168 377547 485672 437223 96307 902863 759104 747933 512899 410317 588598 666688 823202 257684 520631 910066 168864 71499 899972 565350 764848 754913 929040 864132 289976
10
n = int(input())
cnt = [0] * 2
for a in input().split():
    cnt[int(a)%2] += 1
ans = min(cnt[0], cnt[1])
cnt[0] -= ans
cnt[1] -= ans
ans += cnt[1] // 3
print(ans)
