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

using namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	int n, cnt=0;
	vector <int> v;
	cin >> n;
	long long res = 0;
	for(int i = 0; i < n; ++i)
	{
		int a;
		cin >> a;
		if(a%2 == 0)
			res += a;
		else	
		{
			v.push_back(a);
			cnt++;
		}
	}
	sort(v.begin(), v.end());
	for(int i = cnt % 2; i < v.size(); ++i)
		res += v[i];
	if(res != 0)
		cout << res << endl;
	else
		cout << "NIESTETY" << endl;
	return 0;
}