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
34
35
36
#include <cstdio>
#include <algorithm>

const int N = 1000005;
int T[N];

int main() {
	int n;
	scanf("%d", &n);
	int p = 0;
	int minP = 100000;
	int sum = 0;
	for (int i = 0; i < n; ++i) {
		scanf("%d", T + i);
		if (T[i] & 1) {
			++p;
			minP = std::min(minP, T[i]);
		}
		sum += T[i];
	}

	int result;
	if (p & 1) {
		result = sum - minP;
	} else {
		result = sum;
	}

	if (result == 0) {
		printf("NIESTETY\n");
	} else {
		printf("%d\n", result);
	}

	return 0;
}