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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
using namespace std;
typedef vector<int> VI;
typedef long long LL;
#define FOR(x, b, e) for (int x = b; x <= (e); ++x)
#define FORD(x, b, e) for (int x = b; x >= (e); --x)
#define REP(x, n) for (int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for (VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

int n;
int a;
int minNP = 1001; 
int sum;

int main() {
	scanf("%d", &n);
	while (n--) {
		scanf("%d\n", &a);
		sum += a;
		if (a % 2 == 1) {
			minNP = minNP > a ? a : minNP;
		}
	}
	if (sum % 2 == 0) {
		printf("%d\n", sum);
	} else {
		sum -= minNP;
		if (sum > 0) {
			printf("%d\n", sum);
		} else {
			printf("NIESTETY\n");
		}
	}
	return 0;
}