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
#include <stdio.h>
#include <vector>

using namespace std;

int n, answer;
vector<int> odd, even;

void load ()
{
    scanf ("%d", &n);
    
    int cash;
    for (int i = 0; i < n; ++i)
    {
	scanf ("%d", &cash);
	if (cash & 1)
	    odd.push_back (cash);
	else
	    even.push_back (cash);
    }
}

int vector_sum (vector<int> &v)
{
    int sum = 0;
    for (int i = 0; i < v.size (); ++i)
	sum += v[i];
    return sum;
}

void solve ()
{
    answer = 0;
    answer += vector_sum (even);
    answer += vector_sum (odd);
    
    if (!odd.size ())
	return;
    
    int minimum = odd[0];
    for (int i = 0; i < odd.size (); ++i)
	if (minimum > odd[i])
	    minimum = odd[i];

    if ((odd.size ()) & 1)
	answer -= minimum;
}

int main ()
{
    load ();
    solve ();
    if (answer)
	printf ("%d\n", answer);
    else
	printf ("NIESTETY\n");
}