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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long LL;

//*******************
//*******************

int n;
vector<int> v;

void read() {
	cin>>n;
	for(int i=0; i<n; i++)
	{
		int a; cin>>a; v.push_back(a);
	}
}
int w = 0;
void solve() {
	int ile=0;
	int Min = 1000000;
	for(int i=0; i<n; i++)
	{		
		w+=v[i];
		if(v[i]%2)
		{
			++ile;
			Min=min(Min, v[i]);
		}	
	}

	if(ile%2)
		w-=Min;



}

void clean() {
}

int main() {
  ios::sync_with_stdio(false);

     read();
     solve();
     if(w==0)
     	cout<<"NIESTETY"<<endl;
     else
     	cout<<w<<endl;
     clean();
  
  return 0;
}