1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
#include <cstdio>

using namespace std;

const int kMaxA = 1000;

int main() {
  int n;
  scanf("%d", &n);
  int sum = 0;
  int smallest_odd = kMaxA + 1;
  while (n--) {
    int a;
    scanf("%d", &a);
    sum += a;
    if (a % 2) if (a < smallest_odd) smallest_odd = a;
  }
  if (sum % 2) sum -= smallest_odd;
  if (sum) printf("%d\n", sum); else printf("NIESTETY\n");
  return 0;
}