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 <stdio.h>
#include <stdlib.h>

int main() {
    int n, *A;
    int i, sum, oddCount, oddMin;

    scanf("%d", &n);
    A = malloc(sizeof(int) * n);
    for(i=0; i<n; i++)
        scanf("%d", &A[i]);

    sum = 0;
    oddCount = 0;
    oddMin = 1001;
    for(i=0; i<n; i++) {
        sum += A[i];
        if ((A[i] % 2) == 1) { // odd
            oddCount++;
            oddMin = A[i] < oddMin ? A[i] : oddMin;
        }
    }
    if ((oddCount % 2) == 1) {
        sum -= oddMin;
    }
    if (sum > 0) {
        printf("%d\n", sum);
    } else {
        printf("NIESTETY\n");
    }
    return 0;
}