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
50
51
52
53
54
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
typedef pair<int, int> PII;

#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 INF 1000000001

constexpr const int MXN = 1000000;
constexpr const int MXV = 1000;

static_assert(MXN * MXV == 1000000000LL, "Error bad int values");

int main()
{
    int n;
    int mnV = 0;
    int s = 0;
    int v;

    cin >> n;
    REP(i, n) {
        cin >> v;
        s += v;
        if (v % 2 && (mnV == 0 || v < mnV)) mnV = v;
    }

    if (s % 2) s -= mnV;

    if (s > 0)
        cout << s << "\n";
    else
        cout << "NIESTETY\n";

    return 0;
}