# 数组 — 先读 n，再读 n 个数
n = int(input())
a = list(map(int, input().split()))
print(' '.join(map(str, a)))
# 多组直到 EOF
try:
while True: print(sum(map(int, input().split())))
except EOFError: pass
# 链表 — 1,2,3,null 逗号分隔
vals = input().split(',')
head = cur = None
for v in vals:
if v == 'null': continue
node = ListNode(int(v))
if not head: head = cur = node
else: cur.next = node; cur = node
# 二叉树 — 层序，null 表示空节点
s = input().split(',')
root = TreeNode(int(s[0])) if s and s[0] != 'null' else None
q, i = ([root] if root else []), 1
while q and i < len(s):
node = q.pop(0)
for side in ('left', 'right'):
if i < len(s) and s[i] != 'null': setattr(node, side, TreeNode(int(s[i]))); q.append(getattr(node, side))
i += 1
