/*		Kieszonkowe [B]
 *		Marek Iwaniuk
 *		O(n)
 */

//#include "stdafx.h"
#include <iostream>
#include <cstdio>
#include <algorithm>

//#define scanf scanf_s
#define INF 999999999
using namespace std;

class Pocket {
	private:
		int n, in, vovel = 0, minimal = INF;
		long long res = 0, sum_of_vovel = 0;
	public:
		Pocket() {
			scanf("%d", &n);
			for (int i = 1; i <= n; i++) {
				scanf("%d", &in);
				if (in % 2 == 0) {
					res += (long long)in;
				}
				else {
					vovel++;
					sum_of_vovel += in;
					minimal = min(minimal, in);
				}
			}
			res += sum_of_vovel;
			if (vovel % 2 == 1) {
				res -= minimal;
			}
		}

		void Answer() {
			if (res == 0) {
				printf("NIESTETY\n");
			}
			else {
				printf("%lld\n", res);
			}
		}
};

int main() {
	Pocket *New = new Pocket();
	New->Answer();
	delete New;
	return 0;
}