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
//Daniel Grzegorzewski
#include <bits/stdc++.h>

#define MP make_pair
#define PB push_back
#define ST first
#define ND second

using namespace std;

typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef long long LL;

void init_ios()
{
     ios_base::sync_with_stdio(0);
     cin.tie(0);
}

const int N = (int)1e6 + 10;

int n, a[N], sum, mn = 1010;

int main()
{
    init_ios();
    cin >> n;
    for (int i = 1; i <= n; ++i) {
    	cin >> a[i];
    	sum += a[i];
    	if (a[i]%2 == 1)
    		mn = min(mn, a[i]);
    }
    if (n == 1 && a[1]%2 == 1) {
    	cout<<"NIESTETY\n";
    	return 0;
    }
    if (sum%2 == 0) {
    	cout<<sum<<"\n";
    	return 0;
    }
    cout<<sum-mn<<"\n";
}