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

public class kie {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = Integer.parseInt(in.nextLine());
        String line = in.nextLine();
        String[] arr = line.split(" ");
        long[] a = parseArr(arr);

        solve(n, a);
    }

    private static long[] parseArr(String[] sArr) {
        long[] iArr = new long[sArr.length];
        for (int i = 0; i < sArr.length; i++) {
            iArr[i] = Integer.parseInt(sArr[i]);
        }
        return iArr;
    }

    public static void solve(long n, long[] a) {
        long sum = 0;
        long minOdd = Long.MAX_VALUE;
        for(long x: a) {
            sum += x;
            if(x % 2 == 1 && minOdd > x) {
                minOdd = x;
            }
        }
        if(sum % 2 == 0) {
            System.out.println(sum);
        } else {
            //if(minOdd == Integer.MAX_VALUE) {
            if(a.length == 1 && a[0] % 2 == 1) {
                System.out.println("NIESTETY");
            } else {
                System.out.println(sum - minOdd);
            }

        }
    }

}