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 <iostream>
#include <cstdio>

const int oddINF = 1001;

int main() {
	int n;
	scanf("%d", &n);
	int sum = 0, minOdd = oddINF, x;
	for (int i = 0; i < n; i++) {
		scanf("%d", &x);
		sum += x;
		if (x % 2 == 1) {
			minOdd = std::min(minOdd, x);
		}
	}
	if (sum % 2 == 0) {
		printf("%d", sum);
	} else if (sum % 2 == 1 && minOdd != oddINF) {
		if (sum - minOdd > 0) {
			printf("%d", sum - minOdd);
		} else {
			printf("NIESTETY");
		}
	}
	return 0;
}