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

using namespace std;

int main()
{
    int n;
    scanf("%d", &n);

    long long sum = 0LL;
    int mn = 1001; // max to 1k

    for(int i = 0; i < n; ++i) {
        int a;
        scanf("%d", &a);

        mn = (a % 2 ? min(mn, a) : mn);
        sum += (long long)a;
    }
    sum = (sum % 2 ? sum - (long long)mn : sum);

    if(!sum)
        puts("NIESTETY");
    else
        printf("%lld", sum);
}