М?
package com.javarush.task.pro.task05.task0505;
import java.util.Scanner;
/*
Reverse
*/
public class Solution {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int N;
while (n<0){
n = scanner.nextInt();
}
int arr[] = new int[n];
int i = 0;
while (i < arr.length) {
N = scanner.nextInt();
if (N > 0) {
arr[i] = N;
i++;
} else {
break;
}
}
if (n % 2 == 0) {
for (int j = n - 1; j >= 0; j--) {
System.out.println(arr[j]);
}
} else {
for (int j = 0; j < arr.length; j++) {
System.out.println(arr[j]);
}
}
}
}