Deep in the smokehouses of Brineport, Lara studies rows of tickets entries. One clean number will settle the guild's oldest argument. Task: Read n integers and print them in reverse order. Input format: First line: n. Second line: n space-separated integers. Output format: Print the n values in reverse order, space-separated. Constraints: 1 <= n <= 23; -100 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 23; -100 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.
