1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
#include<cstdio>
#include<algorithm>

using namespace std;

const int big_number = 100000;

int main() {
    int n, sum = 0, min_odd = big_number;
    scanf("%d", &n);
    if(n == 1) {

        scanf("%d", &sum);

        if(sum % 2 == 0)
            printf("%d\n");
        else
            printf("NIESTETY\n");

    } else {

        for(int i=0, tmp; i < n; i++) {
            scanf("%d", &tmp);
            if(tmp % 2 == 1)
                min_odd = min(min_odd, tmp);
            sum += tmp;
        }

        if(sum % 2 == 0)
            printf("%d\n", sum);
        else
            printf("%d\n", sum - min_odd);

    }
    return 0;
}