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

int n;
int np = 0;
int min_np = 1000000000;
long long sum = 0;

int main(int argc, char **argv)
{
	std::ios_base::sync_with_stdio(0);
	std::cin >> n;
	
	for (int i=0;i<n;++i)
	{
		int k;
		std::cin >> k;
		
		if (k & 1)
		{
			np++;
			min_np = std::min(min_np,k);
		}
		sum += k;
	}
	
	if (np & 1)
		sum -= min_np;
	
	if (sum == 0)
		std::cout << "NIESTETY";
	else
		std::cout << sum;
	
	return 0;
}