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
#include<iostream>
#include<algorithm>
using namespace std;
int tab[1000005];
int main()
{
	ios_base::sync_with_stdio(false);
	long long int n, suma=0;
	tab[0]=0;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>tab[i];
		suma=suma+tab[i];
	}
	sort(tab, tab+n);
	//cout<<suma<<endl;
	for(int i=0;i<=n;i++)
	{
		if((suma-tab[i])%2 == 0)
		{
			suma=suma-tab[i];
			if(suma == 0)
			{
				cout<<"NIESTETY";
				return 0;
			}
			cout<<suma;
			return 0;
		}
		
	}
	cout<<"NIESTETY";
	return 0;
}