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 <stdlib.h>
#include <stdio.h>
#include <algorithm>
using namespace std;

int main() {
    int N = 0;
    scanf("%d",&N);
    long long sum = 0;
    int min_item = 9999999;
    int a = 0;
    for (int x=0;x<N;++x){
        scanf("%d",&a);
        if (a%2 == 1) {
            min_item = min(a,min_item);
        }
        sum += a;
    }
    long long result = 0;
    if (sum%2== 1) {
        result = sum-min_item;
    }
    else {
        result = sum;
    }
    if (result == 0) {
        printf("NIESTETY\n");
    }else {
        printf("%lld\n",result);
    }
    return 0;
}