Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lsa = list(map(str,input().split()))
lsb = []
if N%2 == 0:
    for i in range(N):    
        if i % 2 == 0:
            lsb.append(lsa[i])
        else:
            lsb = [lsa[i]] + lsb
if N%2 == 1:
    for i in range(N):
        if i % 2 == 1:
            lsb.append(lsa[i])
        else:
            lsb = [lsa[i]] + lsb

print(' '.join(lsb))

Fixed submission:
import collections
N = int(input())
lsa = list(map(str,input().split()))
lsb = collections.deque()
if N%2 == 0:
    for i in range(N):    
        if i % 2 == 0:
            lsb.append(lsa[i])
        else:
            lsb.appendleft(lsa[i])
if N%2 == 1:
    for i in range(N):
        if i % 2 == 1:
            lsb.append(lsa[i])
        else:
            lsb.appendleft(lsa[i])

print(' '.join(lsb))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lsa = list(map(str,input().split()))
lsb = []
if N%2 == 0:
    for i in range(N):    
        if i % 2 == 0:
            lsb.append(lsa[i])
        else:
            lsb.insert(0,lsa[i]) 
if N%2 == 1:
    for i in range(N):
        if i % 2 == 1:
            lsb.append(lsa[i])
        else:
            lsb.insert(0,lsa[i])

print(' '.join(lsb))

Fixed submission:
import collections
N = int(input())
lsa = list(map(str,input().split()))
lsb = collections.deque()
if N%2 == 0:
    for i in range(N):    
        if i % 2 == 0:
            lsb.append(lsa[i])
        else:
            lsb.appendleft(lsa[i])
if N%2 == 1:
    for i in range(N):
        if i % 2 == 1:
            lsb.append(lsa[i])
        else:
            lsb.appendleft(lsa[i])

print(' '.join(lsb))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lsa = list(map(str,input().split()))
lsb = []
for i in range(N):
    if N%2 == 0:
        if i % 2 == 0:
            lsb.append(lsa[i])
        else:
            lsb.insert(0,lsa[i]) 
    if N%2 == 1:
        if i % 2 == 1:
            lsb.append(lsa[i])
        else:
            lsb.insert(0,lsa[i])

print(' '.join(lsb))

Fixed submission:
import collections
N = int(input())
lsa = list(map(str,input().split()))
lsb = collections.deque()
if N%2 == 0:
    for i in range(N):    
        if i % 2 == 0:
            lsb.append(lsa[i])
        else:
            lsb.appendleft(lsa[i])
if N%2 == 1:
    for i in range(N):
        if i % 2 == 1:
            lsb.append(lsa[i])
        else:
            lsb.appendleft(lsa[i])

print(' '.join(lsb))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lsa = list(map(str,input().split()))
lsb = []
for i in range(N):
    if N%2 == 0:
        if i % 2 == 0:
            lsb.append(lsa[i])
        else:
            lsb.insert(0,lsa[i]) 
    if N%2 == 1:
        if i % 2 == 1:
            lsb.append(lsa[i])
        else:
            lsb.insert(0,lsa[i])

print(' '.join(lsb))

Fixed submission:
import collections
N = int(input())
lsa = list(map(str,input().split()))
lsb = collections.deque()
if N%2 == 0:
    for i in range(N):    
        if i % 2 == 0:
            lsb.append(lsa[i])
        else:
            lsb.appendleft(lsa[i])
if N%2 == 1:
    for i in range(N):
        if i % 2 == 1:
            lsb.append(lsa[i])
        else:
            lsb.appendleft(lsa[i])

print(' '.join(lsb))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lsa = list(map(int,input().split()))
lsb = []
for i in range(N):
    if i % 2 == 0:
        lsb.append(lsa[i])
    else:
        lsb.insert(0,lsa[i])
    
if N%2 == 1:
    lsb.reverse() 
lsans = [str(i) for i in lsb]
print(' '.join(lsans))

Fixed submission:
import collections
N = int(input())
lsa = list(map(str,input().split()))
lsb = collections.deque()
if N%2 == 0:
    for i in range(N):    
        if i % 2 == 0:
            lsb.append(lsa[i])
        else:
            lsb.appendleft(lsa[i])
if N%2 == 1:
    for i in range(N):
        if i % 2 == 1:
            lsb.append(lsa[i])
        else:
            lsb.appendleft(lsa[i])

print(' '.join(lsb))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lsa = list(map(int,input().split()))
lsb = []
for i in range(N):
    if i % 2 == 0:
        lsb.append(lsa[i])
    else:
        lsb.insert(0,lsa[i])
    
if N%2 == 1:
    lsb.reverse() 
lsans = [str(i) for i in lsb]
print(' '.join(lsans))

Fixed submission:
import collections
N = int(input())
lsa = list(map(str,input().split()))
lsb = collections.deque()
if N%2 == 0:
    for i in range(N):    
        if i % 2 == 0:
            lsb.append(lsa[i])
        else:
            lsb.appendleft(lsa[i])
if N%2 == 1:
    for i in range(N):
        if i % 2 == 1:
            lsb.append(lsa[i])
        else:
            lsb.appendleft(lsa[i])

print(' '.join(lsb))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lsa = list(map(int,input().split()))
lsb = []
for i in range(N):
    lsb.append(lsa[i])
    lsb.reverse()
lsans = [str(i) for i in lsb]
print(' '.join(lsans))

Fixed submission:
import collections
N = int(input())
lsa = list(map(str,input().split()))
lsb = collections.deque()
if N%2 == 0:
    for i in range(N):    
        if i % 2 == 0:
            lsb.append(lsa[i])
        else:
            lsb.appendleft(lsa[i])
if N%2 == 1:
    for i in range(N):
        if i % 2 == 1:
            lsb.append(lsa[i])
        else:
            lsb.appendleft(lsa[i])

print(' '.join(lsb))