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
36
37
38
39
40
#include <cstdio>
#include <algorithm>

using namespace std;

const int INF = 1000000001;

/*************************************************************************/

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

    int sum = 0;
    int minOdd = INF;

    while (n--)
    {
        int x;
        scanf("%d", &x);

        sum += x;

        if (x%2)
            minOdd = min(minOdd, x);
    }

    if (sum%2)
        sum -= minOdd;

    if (sum)
        printf("%d", sum);
    else
        printf("NIESTETY");

    return 0;
}

/*************************************************************************/