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
#include <iostream>
#include <cstdio>
#include <stdlib.h>
#include <stdio.h>
#include <vector>

using namespace std;

int main(){

	long long suma = 0;
	long long smallestOddNumber = 0;

	long long n;
	scanf("%llu", &n);

	vector <int> banknotes;
	for (int i = 0; i < n; i++) {
		int m;
		scanf("%d", &m);
		banknotes.push_back(m);
	}


	for(int i = 0; i < n; ++i){
		suma += banknotes[i];
		if(banknotes[i] % 2 != 0){
			if(smallestOddNumber == 0){
				smallestOddNumber = banknotes[i];
			}
			smallestOddNumber = (banknotes[i] < smallestOddNumber) ? banknotes[i] : smallestOddNumber;
		}
	}

	if(suma % 2 == 0){
		printf("%llu", suma);
		return 0;
	}
	else{
		suma = suma - smallestOddNumber;
	}
	if(suma == 0){
		printf("NIESTETY");
		return 0;
	}else{
		printf("%llu", suma);
		return 0;
	}
}