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

int main()
{
	long long int suma=0;
	int n, i, t, temp = 0;
	scanf("%ld\n", &n);
	std::vector<int> vec;	
	for (i = 0; i<n; i++) {
		scanf("%ld", &t);
		if (t & 1) {
			vec.push_back(t);
		} else {
			suma+=t;
		}
	}
	if (suma == 0 && vec.size() < 2) {
		printf("NIESTETY\n");
	} else {
		std::sort(vec.rbegin(), vec.rend());
		for (i = 0; i<vec.size(); i++) {
			if (temp == 0) {
				temp = vec[i];
			} else {
				temp += vec[i];
				suma += temp;
				temp = 0;
			}
		}
		printf("%ld\n", suma);
	}
	return 0;
}