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
#include <cstdio>
#include <algorithm>

using namespace std;

const int MAX_A = 1000;

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

    if (sum % 2 == 0) {
        printf("%d\n", sum);
    }
    else if ((min_odd <= MAX_A) && (n > 1)) {
        printf("%d\n", sum - min_odd);
    }
    else {
        printf("NIESTETY\n");
    }

    return 0;
}