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

using namespace std;

int main()
{
	static const unsigned long outOfRange = 1000001;
	unsigned long N, A, i, lowestOdd = outOfRange;
	unsigned long long sum = 0;
	
	cin >> N;
	for (i = 0; i < N; ++ i)
	{
		cin >> A;
		sum += A;
		if((A&1) == 1 && A < lowestOdd)
		{
			lowestOdd = A;
		}
	}

	if ((sum & 1) != 0 && lowestOdd < outOfRange)
	{
		sum -= lowestOdd;
	}

	if (sum == 0 || (sum & 1) != 0)
	{
		cout << "NIESTETY" << endl;
	}
	else
	{
		cout << sum << endl;
	}

	return 0;
}