#include <bits/stdc++.h>

using namespace std;

int dp[(1 << 20) + 7];
int pos[27][2];
int main()
{
	int n;
	cin >> n;
	for (int j = 0; j < 2; j++)
	{
		for (int i = 1; i <= n; i++)
		{
			int x;
			cin >> x;
			pos[x][j] = i;
		}
	}
	for (int mask = 0; mask < (1 << n); mask++)
	{
		int bitCnt = 0;
		for (int i = 0; i < n; i++)
		{
			if (mask & (1 << i)) bitCnt++;
		}
		int any = 0;
		for (int i = 0; i < n; i++)
		{
			if (mask & (1 << i))
			{
				dp[mask] = i;
				any = i;
			}
		}
		if (bitCnt == 1)
		{
			dp[mask] = any + 1;
		}
		else
		{
			int p = 0;
			if (bitCnt % 2 != n % 2) p = 1;
			dp[mask] = dp[mask ^ (1 << any)];
			for (int i = 0; i < n; i++)
			{
				if (mask & (1 << i))
				{
					if (pos[dp[mask ^ (1 << i)]][p] < pos[dp[mask]][p])
					{
						dp[mask] = dp[mask ^ (1 << i)];
					}
				}
			}
		}
	}
	printf("%d\n", dp[(1 << n) - 1]);
}