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

using namespace std;

const string NO_VALID_SOLUTION("NIESTETY");
const unsigned long BEYOND_VALUE = 1001;

int main(int argc, char** argv)
{
	unsigned long banknotes_count;
	unsigned long banknotes_sum = 0;
	unsigned long lowest_odd_banknote_value = BEYOND_VALUE;

	unsigned long i;
	unsigned long current_banknote_value;

	cin >> banknotes_count;

	for (i = 0; i < banknotes_count; i++)
	{
		cin >> current_banknote_value;

		banknotes_sum += current_banknote_value;

		if ((current_banknote_value % 2)
			&&
			(current_banknote_value < lowest_odd_banknote_value))
		{
			lowest_odd_banknote_value = current_banknote_value;
		}
	}

	unsigned long maximum_payable_sum = (banknotes_sum % 2)
		? (banknotes_sum - lowest_odd_banknote_value)
		: banknotes_sum;

	if (maximum_payable_sum > 0)
	{
		cout << maximum_payable_sum;
	}
	else
	{
		cout << NO_VALID_SOLUTION;
	}

	return 0;
}