#include <stdio.h>
#include <algorithm>
#define size 1001
#define TheMax 100000000
using namespace std;

int a[size], b[size];
int N;

int Solve()
{
	int i, j, max, tmp;
	for (i = 0; i < N; i++)
	{
		scanf("%d", &a[i]);
	}
	for (i = 0; i < N; i++)
	{
		scanf("%d", &b[i]);
	}
	sort(a, a + N);
	sort(b, b + N);
	max = -TheMax;

	for (i = 0; i < N; i++)
	{
		tmp = -i;
		for (j = 0; i + j < N; j++)
		{
			if (a[i + j] > b[j])
			{
				tmp++;
			}
			else if (a[i + j] < b[j])
			{
				tmp--;
			}
		}
		if (tmp > max)
		{
			max = tmp;
		}
	}
	return max * 200;
}

int main()
{
	while (scanf("%d", &N) != -1 && N)
	{
		printf("%d\n", Solve());
	}	
	return 0;
}