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
#include <cstdio>
#include <algorithm>
long long n, a, parz, nparz, min=1<<30, sum;
int main(){
    scanf("%lld", &n);
    for( int i=1 ; i<=n ; i++ ){
        scanf("%lld", &a);
        sum+=a;
        if( a%2==0 )
            parz++;
        else{
            nparz++;
            min=std::min(min, a);
        }
    }
    if( n==1 && nparz==1 ){
        printf("NIESTETY\n");
        return 0;
    }
    if( nparz>0 && nparz%2!=0 )
        printf("%lld\n", sum-min);
    else
        printf("%lld\n", sum);

}