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;

/**
 * @author Jaca777
 *         Created 2015-09-28 at 19
 */
public class kie {

    public static void main(String... args) {
        solve();
    }

    public static void solve() {
        Scanner scanner = new Scanner(System.in);
        int amount = scanner.nextInt();
        int[] nVals = new int[amount];
        for (int i = 0; i < nVals.length; i++) {
            nVals[i] = scanner.nextInt();
        }

        int sum = 0;
        int lastOdd = -1;
        for (int nVal : nVals) {
            if (nVal % 2 == 0) sum += nVal;
            else {
                if (lastOdd == -1) {
                    lastOdd = nVal;
                } else {
                    sum += lastOdd + nVal;
                    lastOdd = -1;
                }
            }
        }

        if (sum > 0) System.out.println(sum);
        else System.out.println("NIESTETY");
    }
}