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
//	Michal Zagorski
//	Kieszonkowe:B

#include <cstdio>

int main(){
	int n;
	scanf("%d", &n);
	int minimum = 1001;
	long long int result = 0ll;
	int a = 0;
	for(int i = 0; i < n; i++){
		scanf("%d", &a);
		result+=a;
		if(a%2 == 1){
			if(a<minimum){
				minimum = a;
			}
		}
	}
	if(result % 2 == 1){
		result -= minimum;
	}
	if(result){
		printf("%lld", result);
	}
	else{
		printf("NIESTETY");
	}
	return 0;

}