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;

const int MAX_N = 1000005;

int tab[MAX_N];

int main()
{
    int n, sum=0;
    scanf("%d", &n);
    for (int i=1; i<=n; i++)
    {
        scanf("%d", &tab[i]);
        sum += tab[i];
    }
    sort(tab+1, tab+n+1);
    int i;
    for (i=0; i<=n && sum%2==1 && tab[i]%2==0; i++);
    sum -= tab[i];
    if (sum == 0)
        printf("NIESTETY\n");
    else
        printf("%d\n", sum);
    return 0;
}