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
import java.util.Scanner;

public class kie {
  public static void main(String args[]) {
	  Scanner sc = new Scanner(System.in);
	  
	  int n = sc.nextInt();
	  int minOdd = Integer.MAX_VALUE;
	  long sum = 0L;
	  
	  for (int i=0; i<n; i++) {
		  int k = sc.nextInt();
		  if (k % 2 > 0) {
			  minOdd = Math.min(minOdd, k);
		  }
		  sum += k;
	  }
	  sc.close();
	  
	  if (sum % 2 > 0) {
		  sum -= minOdd;
		  if (sum > 0) {
			  System.out.println(sum);
		  } else {
			  System.out.println("NIESTETY");
		  }
	  } else {
		  System.out.println(sum);
	  }
  }
}