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
#include <algorithm>
#include <cstdio>
using namespace std;
const int INF = 1000000001;

int main()
{
  int n;
  scanf("%d", &n);
  if (n == 1)
  {
    int x;
    scanf("%d", &x);
    if (x%2 == 0) printf("%d\n", x);
    else printf("NIESTETY\n");
  }
  else
  {
    int sum = 0;
    int odd = 0;
    int minOdd = INF;
    for (int i=0; i<n; ++i)
    {
      int x;
      scanf("%d", &x);
      sum += x;
      if (x%2 == 1)
      {
        ++odd;
        minOdd = min(minOdd,x);
      }
    }
    if (odd%2 == 0) printf("%d\n", sum);
    else printf("%d\n", sum-minOdd);
  }
}