from copy import deepcopy
def insert(lst,a):
yes = False
for i in range(1,len(lst)):
for j in range(i):
if lst[j]>lst[i]:
m = lst[i]
for k in range(i,j,-1):
lst[k] = lst[k-1]
lst[j] = m
break
if yes and lst!=a:
break
if lst==a:
yes = True
return yes,lst
def merge(lst,a):
yes = False
k = 2
while True:
for i in range(len(lst)//k+1):
m = min(len(lst),(i+1)*k)
m2 = min(len(lst),i*k+k//2)
#print('i',i,k,m2)
for j in range(i*k,m2):
#print('j',j,end=' ')
for k2 in range(m2,m):
#print('k2',k,end=' ')
if lst[j] > lst[k2]:
tmp = lst[j]
lst[j] = lst[k2]
lst[k2] = tmp
m3 = lst[m2]
if lst[m-1]<m3:
for k3 in range(m2+1,m):
lst[k3-1]=lst[k3]
lst[m-1] = m3
break
for k3 in range(m2+1,m):
if lst[k3]>m3:
for k4 in range(m2+1,k3):
lst[k4-1] = lst[k4]
lst[k3-1] = m3
break
else:
break
k *= 2
if yes:
break
if lst==a:
yes = True
return lst
num = int(input())
a = input().split()
a = [int(i) for i in a]
b = input().split()
b = [int(i) for i in b]
c = deepcopy(a)
yes,c = insert(c,b)
if yes:
print("Insertion Sort")
for i in c:
print(i,end=' ')
#print(str(c)[1:-1])
else:
print("Merge Sort")
c = merge(a,b)
for i in c:
print(i,end=' ')
#print(merge(a,b))