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

const int MAX=1000005;
int n;
long long sum=0;
int mini=MAX;

void read()
{
    cin >> n;
    int a;
    for(int i=0; i<n; i++)
    {
        cin >> a;
        sum+=a;
        if(a%2==1)
        {
            mini=min(mini, a);
        }
    }
}

int main()
{
    read();
    if(sum%2==0)
    {
        cout << sum;
    }
    else
    {
        if(sum-mini==0)
        {
            cout <<"NIESTETY";
        }
        else
        {
            cout << sum-mini;
        }
    }
    return 0;
}