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
/*****************************************************************************
* ZADANIE : Kieszonkowe (runda 1B)                                           *
* AUTOR   : Lukasz Kierat                                                    *
*****************************************************************************/
#include <cstdio>

int main()
{
  int n, val, sum = 0, minOdd = 1001;

  scanf ("%d", &n);
  while (n--) {
    scanf ("%d", &val);
    sum += val;
    if ((val % 2) && val < minOdd)
      minOdd = val;
  }
  if ((sum % 2) == 0)
    printf ("%d", sum);
  else if (sum > minOdd)
    printf ("%d", sum - minOdd);
  else
    printf ("NIESTETY");

  return 0;
}