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 <bits/stdc++.h>
#define LL long long int
#define ULL unsigned long long int
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, f, n) for(int i = (f); i <= (n); ++i)
using namespace std;

const int INF = 1e9+5;

int main()
{
    int n, x;
    scanf("%d", &n);
    int sum = 0, mini = INF;
    REP(i, n)
    {
        scanf("%d", &x);
        sum += x;
        if(x%2 == 1)
            mini = min(mini, x);
    }
    if(sum%2 == 0)
        printf("%d\n", sum);
    else
    {
        if(mini == sum)
            printf("NIESTETY\n");
        else
            printf("%d\n", sum-mini);
    }
    return 0;
}