Problem:


Reversing Numbers

  Write a program which reads a sequence and prints it in the reverse order.

Input

The input is given in the following format:

n
a1 a2 . . . an

n is the size of the sequence and ai is the ith element of the sequence.

Output

  Print the reversed sequence in a line. Print a single space character between adjacent elements (Note that your program should not put a space character after the last element).

Constraints

n ≤ 100

0 ≤ ai < 1000

Sample Input 1

5
1 2 3 4 5

Sample Output 1

5 4 3 2 1

Sample Input 2

8
3 3 4 4 5 8 7 9

Sample Output 2

9 7 8 5 4 4 3 3

Note

      解説      

	



Sample input:
5
1 2 3 4 5


Sample output:
5 4 3 2 1

Submission status: Accepted

Solution code:
n=int(raw_input())
m=map(int, raw_input().split())
m.reverse()
print " ".join(map(str, m))

Submission status: Accepted

Solution code:
n = input()
data = map(int, raw_input().split())
cnt = len(data)
while cnt > 0:
	cnt -= 1
	print data[cnt],

Submission status: Accepted

Solution code:
n = raw_input()
a = raw_input().split()
a.reverse()
print " ".join(a)

Submission status: Accepted

Solution code:
n = input()
a = map(int, raw_input().split())
for i in range(n-1,-1,-1):
    print a[i],

Submission status: Accepted

Solution code:
input()
a = map(int, raw_input().split())

a.reverse()
print(" ".join(map(str, a)))

Submission status: Accepted

Solution code:
n = input()
nums = map(int,raw_input().split())
nums.reverse()
print " ".join(map(str, nums))

Submission status: Accepted

Solution code:
n = input()
li = []
for item in map(int,raw_input().split()):
    if n >= 1:
        li.append(item)
    n -= 1
li.reverse()
for item2 in li:
    print item2,

Submission status: Accepted

Solution code:
n = input()
li = map(int,raw_input().split())
while n >= 1:
    print li[n-1],
    n -= 1

Submission status: Accepted

Solution code:
num = int(input())
num_list = list(map(int, input().split(" ")))

num_list.reverse()
print(*num_list)

Submission status: Accepted

Solution code:
n = int(input())
l = input().split()
l.reverse()
print(" ". join(l))

Submission status: Accepted

Solution code:
N=int(input())
A=list(map(int,input().split()))
for i in range(N):
    if i==N-1:
        print(A[0])
    else:
        print(A[N-i-1],end=" ")

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
for i in range(n-1, -1, -1):
    if i == 0:
        print(a[i])
    else:
        print(a[i], end=' ')

Submission status: Accepted

Solution code:
n = input()
a = list(map(int, input().split()))
a.reverse()
print(" ".join(map(str, a)))

Submission status: Accepted

Solution code:
l = input()
a = list(map(int, input().split()))

a.reverse()

print(" ".join(map(str,a)))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a.reverse()
print(*a)

Submission status: Accepted

Solution code:
N=int(input())
a=list(map(int,input().split()))
a=a[::-1]
print(*a)

Submission status: Accepted

Solution code:
n=input()
a = list(map(int, input().split()))
print(" ".join(map(str, a[::-1])))

Submission status: Accepted

Solution code:
n = int(input())
a = input().split()
a.reverse()
print(" ".join(a))

Submission status: Accepted

Solution code:
n = int(input())
s = list (map(int,input().split()))

print(*s[::-1])

Submission status: Accepted

Solution code:

x=int(input())
list=list(map(int,input().split()))

list.reverse()

print(" ".join([str(n) for n in list]))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))

print(*a[::-1])

Submission status: Accepted

Solution code:
n = int(input())
lst = list(map(int, input().split()))
lst.reverse()
for i, elm in enumerate(lst):
    if i != n-1:
        print(elm, end=" ")
    else:
        print(elm)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
for i in range(n-1):
    print(a[n-1-i],end=' ')
print(a[0])

Submission status: Accepted

Solution code:
n = int(input())
a= reversed(input().split())
print(" ".join(a))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
print(*a[::-1])

Submission status: Accepted

Solution code:
n=int(input())
lis=list(map(int,input().split()))
N=n-1
while N>0:
 print(lis[N],end=" ")
 N-=1
 if N == 0:
  break
print(lis[0])

Submission status: Accepted

Solution code:
n=(int)(input())
a=input()
an=a.split()
ani= [int(s) for s in an]
j=0
for i in reversed(ani):
    print(i,end="")
    if j==n-1:
        print("")
    else:
        print(" ",end="")
    j=j+1

Submission status: Accepted

Solution code:
n = int(input())
num_str = input().split()
nums = [int(i) for i in num_str]
s = reversed(nums)
nums_str = [str(i) for i in s]
print(" ".join(nums_str))

Submission status: Accepted

Solution code:
n = input()
array = input().split(" ")
array.reverse()
array2 = " ".join(array)
print(array2)

Submission status: Accepted

Solution code:
x=int(input())
list=list(map(int,input().split()))

list.reverse()

print(" ".join([str(n) for n in list]))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.reverse()

for i in range(n):
    if i>0:
        print(" ",end="")
    print(a[i],end="")
print()

Submission status: Accepted

Solution code:
n=int(input())
lst=list(map(int,input().split()))
lst.reverse()
print(' '.join(map(str,lst)))

Submission status: Accepted

Solution code:
def reversing():
    n = int(input())
    prog = input().split()[::-1]
    prog2 = " ".join(prog)
    print(prog2)


reversing()

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
print(*a[::-1])

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.reverse()
for i in range (n):
    if i==n-1:
        print(a[i])
    else:
        print(a[i],end=" ")

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
a = reversed(a)
print(*a)

Submission status: Accepted

Solution code:
n = int(input())
nums = reversed(input().split())
print(" ".join(nums))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

n=int(input())
a=list(map(int,input().split()))
print(*a[::-1])

Submission status: Accepted

Solution code:
x = int(input())
data = list(map(int, input().split()))
data.reverse()
ans = " ".join(map(str, data))
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
X = list(input().split())
X.reverse()
print(' '.join(X))

Submission status: Accepted

Solution code:
n = int(input())
A = list(map(int,input().split()))
A.reverse()
for i in range(n):
    if i != n-1:
        print(A[i],"",end="")
    else:
        print(A[i])

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
a.reverse()
b = list(map(str,a))
print(" ".join(b))

Submission status: Accepted

Solution code:
n = int(input())
nums = input().split()
rev_nums = nums[-1::-1]
print(*rev_nums, sep =' ')

Submission status: Accepted

Solution code:
n=int(input())
k=0
lst=input().split()
answer=''
lst.reverse()
for i in range(2*n):
    k=i
    if i%2==0:
        answer+=lst[i//2]
    else:
        if k==2*n-1:
            break
        else:
            answer+=' '
print(answer)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
x = str(a[-1])
for i in range(2, n+1):
    x += (" "+str(a[-i]))
print(x)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))

for i, num in enumerate(a[::-1]):
    if(i != len(a)-1):
        print(num, end=" ")
    else:
        print(num)

Submission status: Accepted

Solution code:
n = int(input())
lst = list(map(int,input().split()))

for i in range(n):
    if i == n-1:
        print(lst[-1-i])
    else:
        print(lst[-1-i],end=' ')

Submission status: Accepted

Solution code:
n = int(input())
num = list(map(int, input().split()))
num.reverse()
for i in range(n):
  if i >= 1:
    print(" ", end = "")
  print(num[i], end = "")
print()

Submission status: Accepted

Solution code:
N = int(input())
table = list(map(int,input().split()))
table.reverse()

print(' '.join(map(str,table)))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.reverse()
for i in range(n-1):
    print(a[i],end=" ")
print(a[-1])

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a.reverse()
for i in range(n):
	if i >= 1:
		print(" ", end = '')
	print(a[i], end = '')
print()

Submission status: Accepted

Solution code:
#(42)数列の反転

n=int(input())
lis=list(map(int,input().split()))
N=n-1

while N>0:
    print(lis[N],end=' ')
    N-=1
    
    if N==0:
        break
print(lis[0])

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
print(*a[::-1])

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a.reverse()
print(*a, sep=" ")

Submission status: Accepted

Solution code:
N=int(input())
a=list(map(int,input().split()))
a=a[::-1]
print(*a)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
    print(a[n-1-i],end="")
    if(i!=n-1):
        print(" ",end="")
    else:
        print()

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
    print(a[n-i-1],end="")
    if(i!=n-1):
        print(" ",end="")
    else:
        print()

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
    print(a[n-1-i],end="")
    if(i!=n-1):
        print(" ",end="")
    else:
        print()

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
    print(a[n-1-i],end="")
    if i!=n-1:
        print(" ",end="")
    else:
        print()

Submission status: Accepted

Solution code:
a = int(input())
table = list(map(int,input().split()))
table.reverse()

print(' '.join(map(str,table)))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
    if(i!=n-1):
        print(a[n-i-1],end=" ")
    else:
        print(a[0])

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.reverse()
for i in range(n-1):
    print(a[i],end=' ')
print(a[n-1])

Submission status: Accepted

Solution code:
n = int(input())
nums = list(map(int, input().split()))
nums.reverse()
nums = [str(s) for s in nums]
print(' '.join(nums))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
print(*a[::-1])

Submission status: Accepted

Solution code:
n = int(input())
a = input().split()
print(" ".join(reversed(a)))

Submission status: Accepted

Solution code:
n=int(input())
a=input().split()

print(' '.join(reversed(a)))

Submission status: Accepted

Solution code:

n = int(input())
lst = list(map(int,input().split()))

lst.reverse()

print(' '.join(map(str,lst)))

Submission status: Accepted

Solution code:
_ = int(input())
L = list(map(int, input().split()))
L = L[::-1]
print(' '.join(str(i) for i in L))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.reverse()
print(' '.join(map(str,a)))

Submission status: Accepted

Solution code:
n = int(input())
lst = list(map(int,input().split()))
lst.reverse()
for i, elem in enumerate(lst):
    if i > 0:
        print(" ", end = "")   
    print(elem, end = "")
print()

Submission status: Accepted

Solution code:
N=int(input())
a = list(map(int,input().split()))
a.reverse()
print(" ".join(map(str, a)))

Submission status: Accepted

Solution code:
n = int(input())
q = list(map(int,input().split()))
ans = []
p = len(q)
for i in range(p):
    ans.append(q[p-1])
    p -= 1
    
print(*ans)

Submission status: Accepted

Solution code:
n=int(input())
print(" ".join(input().split()[::-1]))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
    print(a[n-1-i], end='')
    if(n-1!=i):
        print(" ", end='')
print()

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
a.reverse()
print(' '.join(map(str,a)))

Submission status: Accepted

Solution code:
n = int(input())
e = list(map(int, input().split()))
e.reverse()

print(' '.join(map(str,e)))

Submission status: Accepted

Solution code:
n = int(input())
a = input().split()

a.reverse()
print( " ".join(a) )

Submission status: Accepted

Solution code:
n = input()
numbers = input().split()
numbers.reverse()
print(' '.join(numbers))

Submission status: Accepted

Solution code:
n = int(input())
s = input().split()
s.reverse()
print(" ".join(s))

Submission status: Accepted

Solution code:
#
# 6a
#

def main():
    n = int(input())
    a = list(map(int, input().split()))
    a.reverse()
    print(*a)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.reverse()
print(" ".join(map(str,a)))

Submission status: Accepted

Solution code:
def mapt(fn, *args):
    return tuple(map(fn, *args))


def x(char):
    return int(char) if char.isdigit() else char


def sample(listseq):
    print(" ".join(str(i) for i in reversed(listseq)))




n = int(input())
a = mapt(int, input().split(" "))
sample(a)

Submission status: Accepted

Solution code:
lst = []
z = input()
x = map(int, input().split())
lst.extend(x)
lst.reverse()
print(" ".join(map(str, lst)))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
print(*reversed(a))

Submission status: Accepted

Solution code:
n = int(input())
sq = list(map(int, input().split()))
for i in range(n-1):
    print(sq[n-i-1],'',end='')
print(sq[0])

Submission status: Accepted

Solution code:
N=int(input())
C=list(map(int,input().split()))
for i in range(N-1):
  print(C[-1],end=' ')
  C.pop(-1)
print(C[0])

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int, input().split()))
a.reverse()
print(*a, sep=" ")

Submission status: Accepted

Solution code:
n=int(input())
A = list(map(int, input().split()))
A.reverse()
print(" ".join(map(str,A)))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
print(" ".join(map(str, a[::-1])))

Submission status: Accepted

Solution code:
n=int(input())
num=list(map(int,input().split()))

num1=num[n-1:0:-1]
#print(num1)

for i in num1:
   print(i,end=" ")
   
print(num[0])

Submission status: Accepted

Solution code:
n = int(input())
s = list(map(int, input().split()))
s.reverse()
print(*s)

Submission status: Accepted

Solution code:
a=int(input())
li = list(map(int,input().split()))
print(' '.join(map(str, reversed(li))))

Submission status: Accepted

Solution code:
N = int(input())
n = [int(i) for i in input().split()]

n.reverse()

result = map(str, n)
result = " ".join(result)
print(result)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a = a[::-1]
for i in range(len(a) - 1):
    print(a[i], end=' ')
print(a[-1])

Submission status: Accepted

Solution code:
unchi=input()
a=input().split(" ")
print(" ".join(a[::-1]))

Submission status: Accepted

Solution code:
n = int(input())
a = input().split()
#a = a.reverse()
print(" ".join(reversed(a)))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))

for i in range(len(a)-1,0,-1):
    print(a[i], end=' ')
print(a[0])

Submission status: Accepted

Solution code:
n=int(input())
list=input().split()
list.reverse()
L=' '.join(list)
print(L)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))

for i in range (len(a)-1,0,-1):
    print(a[i],end=' ')
print(a[0])

Submission status: Accepted

Solution code:
n=int(input())
x=[int(i) for i in input().split()]
x.reverse()
for i in range(n-1):
    print(x[i],'',end='')
print(x[n-1])

Submission status: Accepted

Solution code:
n=int(input())
var=input()
var=var.split()
i=n-1
while(True):
    if(i==0):
        print(var[0])
        break
    else:
        print(var[i]+" ",end='')
        i-=1

Submission status: Accepted

Solution code:
n = int(input())
nums = list(map(int, input().split()))

for i in range(n):
    if i == n - 1:
        print("{}" .format(nums[n - i - 1])) 
    else:
        print("{}" .format(nums[n - i - 1]) ,end=" ")

Submission status: Accepted

Solution code:
n = int(input())
r = list(map(int,input().split()))
x = r[::-1]
print(" ".join(str(y) for y in x))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.reverse()


print(" ".join(map(str,a)))

Submission status: Accepted

Solution code:
n=int(input())
lis=list(map(int,input().split()))
lis.reverse()
print(' '.join(map(str,lis)))

Submission status: Accepted

Solution code:
n = int(input())
lst = list(map(int, input().split()))
lst.reverse()
print(' '.join(map(str, lst)))

Submission status: Accepted

Solution code:
n = int(input())
list = input().split()

list.reverse()

for i in range(n-1) :
    print(list[i]+" ", end = "")
print (list[n-1])

Submission status: Accepted

Solution code:
n=int(input())
ai=list(map(str,input().split()))

ai.reverse()
print(" ".join(ai))

Submission status: Accepted

Solution code:
n=int(input())
lis = list(map(int,input().split()))

lis.reverse()
print(*lis)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

n = int(input())
a = list(map(int,input().split()))

for i in range(len(a)-1, 0, -1):
    print(a[i], end=' ')
print(a[0])

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a.reverse()
print(" ".join(map(str,a)))

Submission status: Accepted

Solution code:
N=int(input())
lst=list(map(int,input().split()))
lst.reverse()
for i, elem in enumerate (lst):
    if i>0:
        print(" ",end="")
    print(elem,end="")
print()

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
#print('@', a)
#print('@', a[::-1])
print(*a[::-1])

Submission status: Accepted

Solution code:
n=int(input())
l=list(map(int,input().split()))
l.reverse()
print(*l)

Submission status: Accepted

Solution code:
n = int(input())
list02 = []
list01 = input().split()
for b in range(n-1,0,-1):
    print(list01[b],end=' ')
print(list01[0])

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
print(' '.join(map(str, reversed(a))))

Submission status: Accepted

Solution code:
n = int(input())
strs = input().split(" ")
numbers = [int(strs[i]) for i in range(len(strs))]
numbers.reverse()
for i in numbers[:len(numbers)-1]:
    print('%d ' % i, end="")
print(numbers[-1])

Submission status: Accepted

Solution code:
x = input().split()
arr = list(map(int, input().split()))
tmp = []
for i in range(len(arr)-1, -1, -1):
    tmp.append(arr[i])
print(" ".join(list(map(str, tmp))))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int, input().split()))

a.reverse()

print(*a)

Submission status: Accepted

Solution code:
a=int(input())
c=list(map(int,input().split()))
c.reverse()
print(*c)

Submission status: Accepted

Solution code:
n=int(input())
A=list(map(int,input().split()))
A.reverse()
for i in range(n-1):
    print(A[i],end=" ")
print(A[n-1])

Submission status: Accepted

Solution code:
N, *A = map(int, open(0).read().split())
print(" ".join(map(str, reversed(A))))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a.reverse()

for i in range(n):
    if i >= 1:
        print(" ", end = "")
    print(a[i], end = "")
print()

Submission status: Accepted

Solution code:
n=int(input())
lst=input().split()

print(" ".join(lst[::-1]))

Submission status: Accepted

Solution code:
n = int(input())
nums = list(map(int, input().split()))

for i in range(n):
    if i > 0:
        print("", end=" ")
    print(nums[n - i - 1], end="")
print()

Submission status: Accepted

Solution code:
n = int(input())
m = list(map(int, input().split()))

m.reverse()

print(*m)

Submission status: Accepted

Solution code:
n = input()
a = list(map(int, input().split()))
a.reverse()
print(" ".join(map(str, a)))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
N=int(input())
a=list(map(int,input().split()))

a.reverse()
print(*a)

Submission status: Accepted

Solution code:
n=input()
list=input().split()
list.reverse()
print(' '.join(list))

Submission status: Accepted

Solution code:
s = input()
li = [x for x in list(input().split())]
li.reverse()
print(" ".join(li))

Submission status: Accepted

Solution code:
n = int(input())
a = [x for x in input().split()]
ans = []
for i in range(n):
    ans.append(a[n-i-1])
print(' '.join(ans))

Submission status: Accepted

Solution code:
n = int(input())
A = list(map(int, input().split()))
print(' '.join(map(str, reversed(A))))

Submission status: Accepted

Solution code:
n=int(input())
lst=list(map(int,input().split()))
lst.reverse()
print(" ".join(map(str,lst)))

Submission status: Accepted

Solution code:
n = int(input())
num = input().split()
num.reverse()
print(' '.join(num))

Submission status: Accepted

Solution code:
n = int(input())
a = list(input().split())
r_a = [x for x in reversed(a)]
print(" ".join(r_a))

Submission status: Accepted

Solution code:
input()
a = list(map(int, input().split()))
a.reverse()
print(*a, sep=" ")

Submission status: Accepted

Solution code:
n = int(input())
l = [i for i in input().split()]
l.reverse()
print(' '.join(l))

Submission status: Accepted

Solution code:
sequence_size = int(input())

sequence = [x for x in input().split()]

sequence.reverse()

print(" ".join(sequence))

Submission status: Accepted

Solution code:
n=int(input())
l=[]
l=list(map(int,input().split()))
l.reverse()
print(*l)

Submission status: Accepted

Solution code:
n = input()
ls = input().split()
ls.reverse()
print(" ".join(ls))

Submission status: Accepted

Solution code:
n=int(input())
lst=list(map(int,input().split()))
for i in range(n//2):
    lst[i],lst[n-1-i]=lst[n-1-i],lst[i]
print(" ".join(map(str,lst)))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
for i in range(n-1):
    print(a[-i-1], end=' ')
print(a[0])

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
list = a[::-1]
for i in range(n) :
	if i == n-1 :
		print(list[n-1])
	else :
		print(list[i], end=" ")

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.reverse()
print(*a, sep=" ")

Submission status: Accepted

Solution code:
n = int(input())
list02 = []
list01 = input().split()
#print(list01)
#print(list01[0])
#for a in range(0,n):
#  list02.append(list01[n-a-1])
for b in range(n-1,0,-1):
  print(list01[b],end=' ')
print(list01[0])

Submission status: Accepted

Solution code:
n=int(input())
list=list(map(int,input().split()))

list.reverse()


print(" ".join(map(str,list)))

Submission status: Accepted

Solution code:
def resolve():
    _ = int(input())
    nums = list(map(int, input().split()))
    nums.reverse()  # destructive method

    counter = 1
    for num in nums:
        if counter == len(nums):
            print(num)
            break
        else:
            print(num, end=" ")
        counter += 1



resolve()

Submission status: Accepted

Solution code:
n = int(input())
num_list = list(map(int, input().split()))
print(*num_list[::-1])

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a.reverse()
print(' '.join(map(str, a)))

Submission status: Accepted

Solution code:
n = int(input())
InpList = list(map(int, input().split()))
i = n - 1
result=""

while i >= 0:
    result = result + str(InpList[i]) + " "
    i -= 1

print(result[0:len(result)-1])

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.reverse()
print(" ".join(map(str,a)))

Submission status: Accepted

Solution code:
n=int(input())
L=list(map(int,input().split()))

for i in range(n-1,0,-1):
    print(f'{L[i]} ',end='')
print(L[0])

Submission status: Accepted

Solution code:
n=int(input())
x=list(map(int,input().split()))
x.reverse()
print(*x)

Submission status: Accepted

Solution code:
n = int(input())
a = input().split()
a = reversed(a)
print(' '.join(a))

Submission status: Accepted

Solution code:
n=int(input())
m=list(map(int,input().split()))
m.reverse()

print(' '.join(map(str,m)))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a.reverse()
print(' '.join(map(str,a)))   
#' '.join(map(str,a))はリスト化されたものから
#[]を取って''の中に区切りたいものを入れる

Submission status: Accepted

Solution code:
n = int(input())
an = input().split(" ")

for i in range(len(an)):
    an[i] = int(an[i])

for i in range(n-1, -1, -1):
    print(an[i], end="")
    if i != 0:
        print(" ", end="")

print()

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-

def main():
    numbers=[]
    n = int(input())
    numbers=list(map(int,input().split()))
    print(*numbers[::-1])

if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
lst = list(map(int, input().split()))
lst.reverse()
for i in range(n):
    if i == n - 1:
        print(lst[i])
    else:
        print(lst[i], end=" ")

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split(' ')))
a=list(reversed(a))
res=""
for i in range(n):
  if i == n-1:
    res+=str(a[i])
  else:
    res+=str(a[i])+' '

print(res)

Submission status: Accepted

Solution code:
_ = input()
l = [s for s in input().strip().split()]
print(" ".join(reversed(l)))

Submission status: Accepted

Solution code:
n=int(input())
lis=list(map(int,input().split()))
N=n-1
while N>0:
    print(lis[N],end=' ')
    N-=1
    if N==0:
        break
print(lis[0])

Submission status: Accepted

Solution code:
n = int(input())
A = list(map(int, input().split(' ')))
A.reverse()
print(*A)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

num = int(input())
num_arr = [x for x in input().split()]

num_arr_rev = [None] * num
j = 0
for i in range(num,0,-1):
    num_arr_rev[j] = num_arr[i-1]
    j += 1
    
ans = " ".join(num_arr_rev)
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
for i in range(n//2):
        a[i],a[n-1-i]=a[n-1-i],a[i]
print(*a)

Submission status: Accepted

Solution code:
n = int(input())
num = reversed(input().split())
print(" ".join(num))

Submission status: Accepted

Solution code:
a=int(input())
b=list(map(int,input().split()))
b.reverse()
for i in range(len(b)):
    if i==len(b)-1:
        print(b[i])
    else:
        print(b[i],end=" ")

Submission status: Accepted

Solution code:
n = int(input())
a = input().split()
print(' '.join(reversed(a)))

Submission status: Accepted

Solution code:
n=int (input())
a = list(map(int, input().strip().split()))
b=[0]*n
for i in range (n):
    b[i]=a[n-1-i]
print(*b)

Submission status: Accepted

Solution code:
lens = int(input())
nums = list(map(int, input().split()))
print(" ".join(map(str, reversed(nums))))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(str, input().split()))
print(' '.join(a[::-1]))

Submission status: Accepted

Solution code:
a=int(input())
lis=[int(a) for a in input().split()]
lis.reverse()
print(*lis)

Submission status: Accepted

Solution code:
n = int(input())
a = input().split()

print(" ".join(reversed(a)))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a.reverse()
for i in range(n):
    if i >= 1:
        print(" ", end = '')
    print(a[i],end = '')
print()

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a.reverse()
for i, elem in enumerate(a):
    if i > 0:
        print(" ", end = "")   # i が 0 より大きいとき、つまり最初の要素ではないとき空白を出力
    print(elem, end = "")
print()   # 改行を出力

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
for i in range(n-1):
	print(a[n-i-1], end=" ")
print(a[0])

Submission status: Accepted

Solution code:
n=int(input())
nlist=[]
nlist = list(map(int,input().split()))
nlist.reverse()
print(" ".join(map(str,nlist)))

Submission status: Accepted

Solution code:
N = int(input())
a =list(int(x) for x in input().split())
a = a[::-1]
for i in range(len(a)):
    if i == len(a)-1:
        print(a[i],end ="")
    else:
        print(a[i],end =" ") 
print()

Submission status: Accepted

Solution code:

a = []
j = 0

n = int(input())
a = list(map(int, input().split()))


for i in reversed(a):
    print("%s" % i, end="")
    j += 1

    if j != n:
        print(end=" ")
    else:
        print("")

Submission status: Accepted

Solution code:
n = int(input())
lst = list(map(int, input().split()))
lst.reverse()
print(*lst)

Submission status: Accepted

Solution code:
n=int(input())
lst=[int(i) for i in input().split()]
lst.reverse()
print(' '.join(map(str,lst)))

Submission status: Accepted

Solution code:
n = int(input())
a = [int(i) for i in input().split()]
A = a.reverse()
for i, elem in enumerate(a):
    if i > 0:
        print(" ", end="")
    print(elem, end="")
print()

Submission status: Accepted

Solution code:
a = []
size = int(input())
a = list(map(int,input().split()))

a = a[::-1]
for i in range(size):
    if i==(size-1):
        break
    print(a[i],end=" ")
print(a[size-1])

Submission status: Accepted

Solution code:
n = int(input())
l = input().split()[:n]

print(" ".join(l[::-1]))

Submission status: Accepted

Solution code:
n=int(input())
ai=list(map(int,input().split()))
ai.reverse()
print(*ai)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
print(*a[::-1])

Submission status: Accepted

Solution code:
n = int(input())
A = list(map(str, input().split()))
A = reversed(A)
A = " ".join(A)
print(A)

Submission status: Accepted

Solution code:
n = input()
x = list(map(int, input().split()))
x.reverse()

print(" ".join(map(str, x)))

Submission status: Accepted

Solution code:
a = int(input())
lst = list(map(int, input().split()))

lst.reverse()

print(' '.join(map(str, lst)))

Submission status: Accepted

Solution code:
n = int(input())
a = [i for i in input().split()]
a.reverse()
print(' '.join(a))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.reverse()
print(*a)

Submission status: Accepted

Solution code:
x = int(input())
a = list(map(int,input().split()))
a.reverse()
print(*a)

Submission status: Accepted

Solution code:

n=int(input())
org_list=list(map(int,input().split()))
print(*org_list[::-1])

Submission status: Accepted

Solution code:
M=[]
n=int(input())
L=list(map(int,input().split()))
for i in range(n//2):
    L[i],L[n-i-1]=L[n-i-1],L[i]
print(*L)

Submission status: Accepted

Solution code:

n=int(input())
lst = [str(e) for e in input().split()]

lst.reverse()

lst=' '.join(lst)
print(lst)

Submission status: Accepted

Solution code:
n=input()
nlst=input()
lst=nlst.split()
lst.reverse()
print(' '.join(lst))

Submission status: Accepted

Solution code:
#(42)数列の反転

n=int(input())
lis=list(map(int,input().split()))
N=n-1
while N>0:
     print(lis[N],end=' ')
     N-=1
     if N==0:
          break
print(lis[0])

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(str, input().split()))
print(' '.join(reversed(a)))