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

public class kie {

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