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

public class kie {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int minN = 1001;
		long sum = 0;
		for (int i = 0; i < n; i++) {
			int tmp = in.nextInt();
			if (tmp % 2 != 0 && tmp < minN)
				minN = tmp;
			sum += tmp;
		}
		in.close();
		if (sum % 2 == 0)
			System.out.println(sum);
		else if (sum - minN == 0)
			System.out.println("NIESTETY");
		else
			System.out.println(sum - minN);
	}

}