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

using namespace std;

vector<int> values;

int main() {
	int n, last_odd = -1, sum = 0;

	scanf("%d", &n);
	values.resize(n);

	for(int i = 0; i < n; i++)
		scanf("%d", &values[i]);

	sort(values.rbegin(), values.rend());

	for(int i = 0; i < n; i++) {
		if(values[i] & 1 == 1) {
			if(last_odd == -1) {
				last_odd = values[i];
			} else {
				sum += last_odd + values[i]; 
				last_odd = -1;
			}
		} else sum += values[i];
	}

	if(sum == 0) printf("NIESTETY\n");
	else printf("%d\n", sum);

	return 0;
}