A. Attractive Flowers
time limit per test
1 second
memory limit per test
512 megabytes
input
standard input
output
standard output

Maxim wants to give a bouquet of flowers to his girlfriend Ira for her birthday.

The flower shop near his house sells flowers of $$$n$$$ types. Maxim has found out that the store has $$$a_i$$$ flowers of the $$$i$$$-th type. He knows that Ira likes odd numbers. Therefore, Maxim has decided that there should be an odd number of flowers of each type in the bouquet, and the total number of flowers in the bouquet should also be odd.

Help Maxim determine the maximum number of flowers the bouquet can consist of.

Input

The first line contains an integer $$$n$$$ — the number of types of flowers that are sold in the store ($$$1 \le n \le 100\,000$$$).

The second line contains $$$n$$$ integers $$$a_1, a_2, \ldots, a_n$$$ — the number of flowers of each type ($$$1 \le a_i \le 1000$$$).

Output

Print one number — the maximum number of flowers the bouquet can consist of.

Examples
Input
3
3 5 8
Output
15
Input
3
1 1 1
Output
3