codeforces 621A Wet Shark and Odd and Even

A. Wet Shark and Odd and Even

 

 

Today, 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 109, inclusive.

Output

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

Sample test(s)

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.

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int INF=0x3f3f3f3f;
int main()
{
    ll ans=0;
    int cnt=0,minm=INF;
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        int t;
        scanf("%d",&t);
        if(t&1)cnt++,minm=min(minm,t);
        ans+=t;
    }
    if(cnt&1)
        printf("%I64d
",ans-minm);
    else
        printf("%I64d
",ans);
    return 0;
}