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
#include <cstdio>
#include <functional>
#include <algorithm>
#include <vector>
using namespace std;

int main() {
    int n, a, sum = 0;
    scanf("%d", &n);
    vector<int> odd_nums;
    for(int i = 0; i < n; ++i) {
        scanf("%d", &a);
        if(a % 2) {
            odd_nums.push_back(a);
        } else {
            sum += a;
        }
    }
    sort(odd_nums.begin(), odd_nums.end(), greater<int>());
    int end = odd_nums.size();
    if(end % 2) {
        --end;
    }
    for(int i = 0; i < end; ++i) {
        sum += odd_nums[i];
    }

    if(sum > 0) {
        printf("%d\n", sum);
    } else {
        printf("NIESTETY\n");
    }

    return 0;
}