03. Odd / Even Position

package forLoops;

import java.util.Scanner;

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

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

        double oddSum = 0;
        double oddMaxNum = -1000000000.0;
        double oddMinNum = 1000000000.0;
        double evenSum = 0;
        double evenMaxNum = -1000000000.0;
        double evenMinNum = 1000000000.0;
        for (int i = 1; i <= n; i++) {
            double currentNum = Double.parseDouble(scanner.nextLine());

            if (i % 2 != 0) {
                oddSum = oddSum + currentNum;
                if (currentNum > oddMaxNum) {
                    oddMaxNum = currentNum;
                }
                if (currentNum < oddMinNum) {
                    oddMinNum = currentNum;
                }
            } else {
                evenSum = evenSum + currentNum;
                if (currentNum > evenMaxNum) {
                    evenMaxNum = currentNum;
                }
                if (currentNum < evenMinNum) {
                    evenMinNum = currentNum;
                }
            }
        }

        System.out.printf("OddSum=%.2f,%n", oddSum);
        if (oddMinNum == 1000000000.0) {
            System.out.println("OddMin=No,");
        } else {
            System.out.printf("OddMin=%.2f,%n", oddMinNum);
        }
        if (oddMaxNum == -1000000000.0){
            System.out.println("OddMax=No,");
        } else {
            System.out.printf("OddMax=%.2f,%n", oddMaxNum);
        }
        System.out.printf("EvenSum=%.2f,%n", evenSum);
        if (evenMinNum == 1000000000.0){
            System.out.println("EvenMin=No,");
        } else {
            System.out.printf("EvenMin=%.2f,%n", evenMinNum);
        }
        if (evenMaxNum == -1000000000.0){
            System.out.println("EvenMax=No");
        } else {
            System.out.printf("EvenMax=%.2f%n", evenMaxNum);
        }
    }
}