题目描述 You are given a sequence of integer numbers. Zero-complexity transposition of the sequence is the reverse of this sequence. Your task is to write a program that prints zero-complexity transposition of the given sequence. 输入格式 For each case, the first line of the input file contains one integer $n$ - length of the sequence ($0 < n \leq 10000$). The second line contains $n$ integers numbers - $a 1$, $a 2$, ..., $a n$ ($-1000000000000000 \leq a i \leq 1000000000000000$). 输出格式 For each case, on the first line of the output file print the sequence in the reverse order. 输入样例 5 -3 4 6 -8 9 输出样例 9 -8 6 4 -3