Niestety, nie byliśmy w stanie w pełni poprawnie wyświetlić tego pliku, ponieważ nie jest zakodowany w UTF-8. Możesz pobrać ten plik i spróbować otworzyć go samodzielnie. 
  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
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
//#include "stdafx.h"

#include <complex>
#include <iterator>
#include <set>
#include <bitset>
#include <map>
#include <stack>
#include <list>
#include <queue>
#include <deque>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>

#include <typeinfo>
#include <ctype.h>
#include <math.h>
#include <sstream>

using namespace std;
typedef vector<int> VI;
typedef long long LL;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<double> VD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

#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) auto 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

const int INF = 1000000001;
const double EPS = 10e-9;


template <class V, class E> struct Graph {
	struct Ed : E {
		int v;
		Ed(E p, int w) : E(p), v(w) { }
	};
	struct Ve : V, vector < Ed > { };
	vector<Ve> g;

	Graph(int n = 0) : g(n) { }

	void EdgeD(int b, int e, E d = E()) {
		g[b].PB(Ed(d, e));
	}

	void EdgeU(int b, int e, E d = E()) {
		Ed eg(d, e);
		eg.rev = SIZE(g[e]) + (b == e);
		g[b].PB(eg);
		eg.rev = SIZE(g[eg.v = b]) - 1;
		g[e].PB(eg);
	}

	void Write() {
		REP(x, SIZE(g)) {
			cout << x << ":";
			FOREACH(it, g[x]) cout << " " << it->v;
			cout << endl;
		}
	}
};

struct Empty { };

void test()
{
	int n, m, b, e;
	cin >> n >> m;
	Graph<Empty, Empty> gr(n);
	REP(x, m) {
		cin >> b >> e;
		gr.EdgeD(b, e);
	}

	gr.Write();
}


int main()
{
	LL n;
	cin >> n;

	LL minim = INF;
	LL a;
	LL cnt = 0;
	LL sum = 0;

	REP(x, n)
	{
		cin >> a;
		if (a % 2 == 1)
		{
			cnt++;
			minim = min(minim, a);
		}
		sum += a;
	}
	if (cnt % 2 == 1)
	{
		sum -= minim;
	}

	if (sum > 0)
	{
		cout << sum << endl;
	}
	else
	{
		cout << "NIESTETY" << endl;
	}
	return 0;
}