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

using namespace std;

const int N=1e6+50;
int Tab[N];

int main (){
	int n, i, a, suma;
	scanf("%d", &n);
	suma=0;
	for(i=1; i<=n; i++){
		scanf("%d", &Tab[i]);
		suma+=Tab[i];
	}
	if(suma%2==0){
		printf("%d\n", suma);
		return 0;
	}
	sort(Tab+1, Tab+1+n);
	i=1;
	while(Tab[i]%2==0){
		i++;
		if(i>n){
			break;
		}
	}
	if(Tab[i]%2==1 && suma-Tab[i]>0){
		suma-=Tab[i];
		printf("%d\n", suma);
		return 0;
	}
	printf("NIESTETY\n");
	return 0;
}