Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Wet Shark and Odd and Even

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputToday, Wet Shark is given *n* integers. Using any of these integers no more than once, Wet Shark wants to get maximum possible even (divisible by 2) sum. Please, calculate this value for Wet Shark.

Note, that if Wet Shark uses no integers from the *n* integers, the sum is an even integer 0.

Input

The first line of the input contains one integer, *n* (1 ≤ *n* ≤ 100 000). The next line contains *n* space separated integers given to Wet Shark. Each of these integers is in range from 1 to 10^{9}, inclusive.

Output

Print the maximum possible even sum that can be obtained if we use some of the given integers.

Examples

Input

3

1 2 3

Output

6

Input

5

999999999 999999999 999999999 999999999 999999999

Output

3999999996

Note

In the first sample, we can simply take all three integers for a total sum of 6.

In the second sample Wet Shark should take any four out of five integers 999 999 999.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/20/2017 14:46:52 (c2).

Desktop version, switch to mobile version.

User lists

Name |
---|