Algorithm

B. Fortune Telling
time limit per test
2 seconds
memory limit per test
256 megabytes
problem Link- https://codeforces.com/problemset/problem/59/B
input
standard input
output
standard output

Marina loves Sasha. But she keeps wondering whether Sasha loves her. Of course, the best way to know it is fortune telling. There are many ways of telling fortune, but Marina has picked the easiest one. She takes in her hand one or several camomiles and tears off the petals one by one. After each petal she pronounces alternatively "Loves" and "Doesn't love", at that Marina always starts with "Loves". There are n camomiles growing in the field, possessing the numbers of petals equal to a1, a2, ... an. Marina wants to pick a bouquet with the maximal possible total number of petals so that the result would still be "Loves". Help her do that; find the maximal number of petals possible in the bouquet.

Input

The first line contains an integer n (1 ≤ n ≤ 100), which is the number of flowers growing in the field. The second line contains n integers ai (1 ≤ ai ≤ 100) which represent the number of petals on a given i-th camomile.

Output

Print a single number which is the maximal number of petals in the bouquet, the fortune telling on which would result in "Loves". If there are no such bouquet, print 0 instead. The bouquet may consist of a single flower.

Examples
input
Copy
1
1
output
Copy
1
input
Copy
1
2
output
Copy
0
input
Copy
3
5 6 7
output
Copy
13



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <cstdio>

int main(){

    int n(0); scanf("%d", &n);

    int temp(0), total(0), minOdd(101), numOdds(0);
    for(int k = 0; k < n; k++){
        scanf("%d", &temp);
        total += temp;
        if(temp % 2 == 1){++numOdds; if(temp < minOdd){minOdd = temp;}}
    }

    if(minOdd > 100){puts("0");}
    else if(numOdds % 2 == 0){printf("%d\n", total - minOdd);}
    else if(numOdds % 2 == 1){printf("%d\n", total);}

    return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
1 1

Output

x
–
+
cmd
1
Advertisements

Demonstration

Codeforces Solution-B. Fortune Telling-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+