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
// Łukasz Proksa

#include <iostream>
using namespace std;

#define REP(i, n) for(int i = 0; i < (n); ++i)
#define MIN(a, b) ((a) < (b) ? (a) : (b))

static const int MAX_VAL = 1000;

int main()
{
  ios_base::sync_with_stdio(false);
  int n, cnt, min, sum;
  cin>>n;
  sum = cnt = 0;
  min = MAX_VAL + 1;
  REP(i, n) {
    int a;
    cin>>a;
    sum += a;
    if (a % 2) {
      cnt++;
      min = MIN(a, min);
    }
  }
  if (cnt % 2) {
    sum -= min;
  }
  if (sum) {
    cout<<sum<<endl;
  } else {
    cout<<"NIESTETY"<<endl;
  }

  return 0;
}