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 in = new Scanner(System.in);
		
		int n = in.nextInt();
		long sum = 0;
		int minOddT = Integer.MAX_VALUE;
		
		for (int i = 0; i < n; i++) {
			int t = in.nextInt();
			sum += t;
			if (t % 2 == 1 && t < minOddT) {
				minOddT = t;
			}
		}
		
		if (sum % 2 == 0) {
			System.out.println(sum);
		} else {
			sum -= minOddT;
			if (sum > 0) {
				System.out.println(sum);				
			} else {
				System.out.println("NIESTETY");
			}
		}
	}
}