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
39
40
41
42
43
44
45
46
47
#include <algorithm>
#include <climits>
#include <cstdio>
using namespace std;

#undef DEBUG

#define EVEN(X) (X % 2 == 0)
#define ODD(X) (X % 2 != 0)

#define FOR(E, I) for(auto E = I.begin(); E != I.end(); E++)

int main()
{
	unsigned int n, denomination, numberOfOddDenominations = 0, minOddDenomination = UINT_MAX;
	unsigned long totalSum = 0L;

	scanf("%d", &n);

	while (n--)
	{
		scanf("%d", &denomination);

		totalSum += denomination;
		if (ODD(denomination))
		{
			numberOfOddDenominations++;
			minOddDenomination = min(minOddDenomination, denomination);
		}
	}

	if (ODD(numberOfOddDenominations))
	{
		totalSum -= minOddDenomination;
	}

	if (totalSum > 0)
	{
		printf("%ld\n", totalSum);
	}
	else
	{
		puts("NIESTETY");
	}

	return 0;
}