PAT1089

#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<set>


#include<fstream>
using namespace std;


ifstream fin("1089.txt");
//#define cin fin
#define MAX 105
int n;
int num1[MAX], num2[MAX];
bool isready(int len)
{
int i, j;
for (i = 1; i <= n; i += len)
{
for (j = i; j < n&&j < i + len - 1; j++)
{
if (num2[j]>num2[j + 1])
return false;
}
}
return true;
}
int main()
{
cin >> n;
int i, j;
for (i = 1; i <= n; i++)
cin >> num1[i];
for (i = 1; i <= n; i++)
cin >> num2[i];
for (i = 1; i < n;i++)
if (num2[i]>num2[i + 1])
break;
for (j = i + 1; j <= n;j++)
if (num1[j] != num2[j])
break;
if (j == n + 1)
{
cout << "Insertion Sort\n";
sort(num2 + 1, num2 + i + 1 + 1);
for (i = 1; i <= n; i++)
{
cout << num2[i]; break;
}
for (++i; i <= n; i++)
{
cout << " " << num2[i];
}
return 0;
}
else
{
cout << "Merge Sort\n";
int len = 2;
while (isready(len))
len *= 2;
for (i = 1; i <= n; i += len)
{
if (i + len <= n)
sort(num2 + i, num2 + i + len);
else
sort(num2 + i, num2 + n + 1);
}
for (i = 1; i <= n; i++)
{
cout << num2[i]; break;
}
for (++i; i <= n; i++)
cout << " " << num2[i];
}

}