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

using namespace std;


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

    long long int sum = 0;
    int smallest_odd = 10001;

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

        sum += a;

        if(a % 2 == 1 && a < smallest_odd)
            smallest_odd = a;
    }

    if(sum % 2 == 1)
        sum -= smallest_odd;

    sum > 0 ? printf("%lld", sum) : printf("NIESTETY");

    return 0;
}