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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
	int n = 0, a = 0;
	long sum = 0L;
	cin >> n;

	if (n == 1)
	{
		cin >> a;
		if (a % 2 == 0)
			cout << a << endl;
		else
			cout << "NIESTETY" << endl;
	}
	else
	{
		vector<int> banknoty(n);
		for (int i = 0; i < n; i++)
		{
			cin >> a;
			banknoty[i] = a;
			sum += a;
		}

		if (sum % 2 == 0)
			cout << sum << endl;
		else
		{
			vector<int> niep;
			sum = 0;

			for (int i = 0; i < n; i++)
			{
				int a = banknoty[i];
				if (a % 2 == 0)
				{
					sum += a;
				}
				else
				{
					niep.push_back(a);
					banknoty[i] = 0;
				}
			}

			sort(niep.begin(), niep.end());

			for (int i = 1; i <= niep.size() - 1; i++)
				sum += niep[i];

			if (sum > 0)
				cout << sum << endl;
			else
				cout << "NIESTETY" << endl;
		}
	}

	return 0;
}