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
#include <algorithm>

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