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

using namespace std;

int main()
{
	ios_base::sync_with_stdio(0);
	int n;
	long long sum = 0;
	int lowestOdd = 1001;
	int nOdd = 0;
	cin >> n;
	int k;
	for (int i = 0; i < n; ++i)
	{
		cin >> k;
		sum += k;
		if (k % 2)
		{
			nOdd++;
			if (k < lowestOdd)
				lowestOdd = k;
		}
	}
	if (nOdd % 2)
	{
		if (n == 1)
			cout << "NIESTETY\n";
		else
			cout << sum - lowestOdd << endl;
	}
	else
		cout << sum << endl;

	return 0;
}