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
#include <cstdio>
#include <algorithm>
using namespace std;

typedef unsigned long long ULL;
const int N=1000*1000+7;

int main ()
{
	int n;
  scanf("%d", &n);
  int smallest_odd = 1001;
  int sum = 0;
  int a;
  for (int i=0; i<n; i++)
  {
    scanf("%d", &a);
    sum+=a;
    if (a&1)
      smallest_odd = min(smallest_odd, a);
  }
  if (!(sum&1))
    printf("%d\n", sum);
  else
  {
    if (smallest_odd == sum)
      printf("NIESTETY\n");
    else
      printf("%d\n", sum-smallest_odd);
  }
	return 0;
}