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
#include <cstdio>
#include <algorithm>
using namespace std;

const int MAX = 1000005;

int money[MAX], n;

int main(int argc, char ** argv) {
    scanf("%d", &n);
    int sum = 0;
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &money[i]);
        sum += money[i];
    }
    if (sum % 2 == 0) {
        printf("%d\n", sum);
        return 0;
    }

    int maximum = -1;
    for (int i = 1; i < MAX; ++i) {
        if( (sum - money[i]) % 2 == 0 && (sum - money[i]) > 0 ) {
            maximum = max(maximum, sum - money[i]);
        }
    }
    if (maximum != -1) {
        printf("%d\n", maximum);
    } else {
        printf("NIESTETY\n");
    }
    return 0;
}