from collections import deque
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
way=[[0]n for i in range(n)]
path=[]
dir=[(-1,0),(1,0),(0,-1),(0,1)]
def dfs(x,y):
if x==n-1 and y==n-1:
if sum(a)==0 and sum(b)==0:
for i in path:
print(ni[0]+i[1],end=” “)
return
if a[y]==0:
for i in range(y):
if a[i]>0:
return
if b[x]==0:
for i in range(x):
if b[i]>0:
return
for i in range(4):
nx=dir[i][0]+x
ny=dir[i][1]+y
if nx<0 or nx>=n or ny<0 or ny>=n:
continue
if a[ny]>0 and b[nx]>0 and way[nx][ny]==0:
a[ny]=a[ny]-1
b[nx]=b[nx]-1
path.append([nx,ny])
way[nx][ny]=1
dfs(nx,ny)
a[ny]=a[ny]+1
b[nx]=b[nx]+1
path.pop()
way[nx][ny]=0
way[0][0]=1
a[0]=a[0]-1
b[0]=b[0]-1
path.append([0,0])
dfs(0,0)