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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.concurrent.ArrayBlockingQueue;



public class kie {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		String numberOfPaper = scanner.next();
		long num = Long.parseLong(numberOfPaper);
		List<Long> banqnoutesList = new ArrayList<Long>(); 
		for(long i = 0; i < num; i++){
			banqnoutesList.add(Long.parseLong(scanner.next()));
		}
		if(checkMaxAmount(banqnoutesList)==0){
			System.out.println("NIESTETY");
		} else {
			System.out.println(checkMaxAmount(banqnoutesList));
		}
		scanner.close();
	}

	public static long checkMaxAmount(List<Long> banqnoutesList){
		Collections.sort(banqnoutesList);
		if(banqnoutesList.size()<=1){
			return 0l;
		}
		long sum = 0l;
		for (Long long1 : banqnoutesList) {
			sum+=long1;
		}
		if(sum%2==0){
			return sum;
		} else {
			for (Long long1 : banqnoutesList) {
				if(long1%2!=0){
					return sum-long1;
				}
			}
		}
		return 0;
	}

}