Problem J: 纵向倒序输出 [1*] Vertically reverse output [1*]

Problem J: 纵向倒序输出 [1*] Vertically reverse output [1*]

Time Limit: 4 Sec  Memory Limit: 128 MB
Submit: 22  Solved: 10
[Submit] [Status] [Web Board] [Creator:]

Description

【问题】输入N个数,然后把它倒序输出。
[Question] Input N numbers and output them in reverse order.


【输入说明】第一行数值n,接下来n行,每行一个10^8内的整形数字
[Input description] The first line is the value n, the next n lines, each line is an integer number within 10^8


【输出要求】n+1行数据,与输入数据的顺序相反
[Output requirements] n+1 rows of data, in the reverse order of the input data


【说明 explain】n<=100000
本题要使用数组记录输入的数据。输出最后一个数据后也要换行。
提示:因为数据个数非常多,必须用scanf读入数据,否则容易超时。
This problem uses an array to record the input data. Also wrap the line after the last data output.
Tip: Because the number of data is very large, scanf must be used to read in the data, otherwise it is easy to time out.


Input

5
17
58
46
90
180

Output

180
90
46
58
17
5