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
59
#include <cstdio>
#include <iostream>
#include <set>
#include <map>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>
#include <cmath>
#include <iomanip>
#include <deque>
#include <cassert>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int,int> PII;
#define MP make_pair
#define FOR(v,p,k) for(int v=p;v<=k;++v)
#define FORD(v,p,k) for(int v=p;v>=k;--v)
#define REP(i,n) for(int i=0;i<(n);++i)
#define VAR(v,i) __typeof(i) v=(i)
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define SIZE(x) (int)x.size()
#define ALL(c) c.begin(),c.end()
using namespace std;
#define int long long

#undef int
int main() {
#define int long long
    int n;
    cin>>n;
    if(n == 1){
        int a;
        cin>>a;
        if(a & 1){
            cout<<"NIESTETY";
            return 0;
        }
    }
    int minodd = 1001;
    int suma = 0;
    REP(i,n){
        int a;
        cin>>a;
        suma += a;
        if(a & 1){
            minodd = min(minodd, a);
        }
    }
    if(suma & 1){
        suma -= minodd;
    }
    cout<<suma;
    return 0;
}