PAT1035

#include<iostream>
#include <iomanip>
#include <cstdio>
#include<string>
#include<vector>
#include<array>
#include<math.h>
#include<algorithm>
using namespace std;
void insort(int a[],int b[],int n)
{
	int i,k = 0;	
	for (i = 2; i <= n; i++)//多循环一次，直接输出
	{
		sort(a, a + i);
		if (k)
		{
			cout << "Insertion Sort" << endl;
			cout << a[0];
			for (int j = 1; j < n; j++)
				cout << " " << a[j];
			return;

		}
		if (equal(a, a + n, b))
			k = 1;
	}
}
void mesort(int a[], int b[], int n)
{
	int i,j,k = 0;
	for (i = 2; ;i *= 2)
	{
		for (j = 0; j < n; j += i)
		{
			sort(a + j, a + (j + i < n ? j + i : n));
		}
		if (k)
		{
			cout << "Merge Sort" << endl;
			cout << a[0];
			for (int j = 1; j < n; j++)
				cout << " " << a[j];
			return;
		}
		if(equal(a,a+n,b))
			k = 1;
		if (i > n)
			break;

	}
}
int main()
{
	int a[101], b[101],c[101];
	int i,n;
	cin >> n;
	for (i = 0; i < n; i++)
	{
		cin >> a[i];
		c[i] = a[i];
	}
	for (i = 0; i < n; i++)
	{
		cin >> b[i];
		
	}
	insort(a, b, n);

	mesort(c, b, n);
	return 0;

}