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
#include <iostream>
#include <algorithm>
#include <limits>

int main() {
    std::ios_base::sync_with_stdio(false);

    unsigned n;
    unsigned sum = 0;
    unsigned odd_cnt = 0;
    unsigned min_odd = std::numeric_limits<unsigned>::max();

    std::cin >> n;

    for(unsigned i = 0; i < n; i++) {
        unsigned x;
        std::cin >> x;

        sum += x;
        if(x % 2 == 1) {
            odd_cnt ++;
            min_odd = std::min(x, min_odd);
        }
    }

    if(odd_cnt % 2 == 1) sum -= min_odd;

    if(sum == 0) {
        std::cout << "NIESTETY" << std::endl;
    } else {
        std::cout << sum << std::endl;
    }
}