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 <cstdio>
#include <utility>
#include <queue>
#include <set>
#include <list>
#include <map>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
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
#define MP make_pair
#define PII pair<int, int>

int main() {
    int n;
    scanf("%d", &n);
    LL sum = 0;
    int mini = 2000;
    int odd_cnt = 0;
    REP(i, n) {
        int a;
        scanf("%d", &a);
        sum += a;
        if (a % 2) {
            mini = min(mini, a);
            odd_cnt++;
        }
    }
    if (odd_cnt % 2)
        sum -= mini;
    if (sum)
        printf("%lld\n", sum);
    else
        printf("NIESTETY\n");
    return 0;
}