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