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

using namespace std;

const int INF = 1e9+1;

int main(){
	int n,i,suma,min_np,ile_np,a;
	ile_np = suma = 0;
	min_np = INF;
	scanf("%d", &n);
	for(i=0; i<n; i++){
		scanf("%d", &a);
		suma += a;
		if(a%2 == 1) {
			ile_np++;
			min_np = min(min_np,a);
		}
	}
	if(n==1 && ile_np == 1){
		printf("NIESTETY\n");
		return 0;
	}
	if(ile_np%2 == 1) printf("%d\n", suma-min_np);
	else printf("%d\n", suma);
	return 0;
}