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

class kie {
    public static void main(String args[]) {
        Scanner keyboard = new Scanner(System.in);
        int n = keyboard.nextInt();
        if (n > 1000000 || n < 1) {
            System.out.println("NIESTETY");
            System.exit(0);
        }
        int sum = 0;
        int a = -1;
        int oddMin = 0;
        for (int i = 0; i < n; i++) {
            a = keyboard.nextInt();
            if (a < 1 || a > 1000) {
                System.out.println("NIESTETY");
                System.exit(0);
            }
            sum += a;
            if (a % 2 == 1 && (a < oddMin || oddMin == 0)) {
                oddMin = a;
            }
        }
        if (sum % 2 == 0) {
            System.out.println(sum);
        } else {
            sum -= oddMin;
            if (sum % 2 == 0 && sum > 0) {
                System.out.println(sum);
            } else {
                System.out.println("NIESTETY");
            }
        }

        System.exit(0);
    }
}