EvenOddPosition

import java.util.Scanner;

public class EvenOddPosition {
    public static void main(String[] args) {
        Scanner console = new Scanner(System.in);

        int n = Integer.parseInt(console.nextLine());

        double evenSum = 0;
        double oddSum = 0;
        double evenMax = -1000000000.0;
        double evenMin = 1000000000.0;
        double oddMax = -1000000000.0;
        double oddMin = 1000000000.0;

        for (int i = 1; i <= n; i++) {
            double currentNum = Double.parseDouble(console.nextLine());

            if(i % 2 == 0){
                evenSum += currentNum;
                evenMin = (currentNum < evenMin) ? evenMin : currentNum;
                evenMax = (currentNum > evenMax) ? evenMax : currentNum;

            }else{
                oddSum += currentNum;
                oddMin = (currentNum < oddMin) ? oddMin : currentNum;
                oddMax = (currentNum > oddMax) ? oddMax : currentNum;
            }
        }
        System.out.println("OddSum=" + oddSum);
        if(oddMin == 1000000000.0){
            System.out.println("OddMin=No");
        }else{
            System.out.println("OddMin=" + oddMin);
        }
        if(oddMax == -1000000000.0){
            System.out.println("OddMax=No");
        }else{
            System.out.println("OddMax=" + oddMax);
        }
        System.out.println("EvenSum=" + evenSum);
        if(evenMin == 1000000000.0){
            System.out.println("EvenMin=No");
        }else{
            System.out.println("EvenMin=" + evenMin);
        }
        if (evenMax == -1000000000.0){
            System.out.println("EvenMax=No");
        }else{
            System.out.println("EvenMax=" + evenMax);
        }

    }
}