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
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1000000;
const int MAXV = 1000;

int n, sum, a;
int odd_num, odd_min = MAXV + 1;

int main() {
    scanf("%d", &n);
    for(int i = 0; i < n; ++i) {
        scanf("%d", &a);
        sum += a;
        if(a % 2 == 1) {
            odd_min = min(odd_min, a);
            odd_num++;
        }
    }
    if(sum % 2 == 0) printf("%d\n", sum);
    else if(odd_num > 0 && sum > odd_min) printf("%d\n", sum - odd_min);
    else printf("NIESTETY\n");
    return 0;
}