//2502427 2010-05-30 15:33:27 Accepted 1052 15MS 244K 830 B C++ T&T
//简单的贪心 两头贪心以免从大到小贪心时 强马相等 直接用慢马去和强马比 这样就失去了慢马的优势
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int cmp(int a,int b)
{
return a > b;
}
int main()
{
int n,t[1010],k[1010];
int i,j,ts,te,ks,ke,p;
int w,l,sum;
while(scanf("%d",&n) != EOF && n)
{
ts = 0;ks = 0; te = n - 1;ke = n - 1;
p = 0; w = 0; l = 0;
for(i = 0; i < n; i++)
{
scanf("%d",&t[i]);
}
for(i = 0; i < n; i++)
{
scanf("%d",&k[i]);
}
sort(t,t + n,cmp);
sort(k,k + n,cmp);
while(p < n)
{
while(p < n && t[ts] > k[ks])
{
w++;
ts++;
ks++;
p++;
}
while(p < n && t[te] > k[ke])
{
w++;
ke--;
te--;
p++;
}
if(p < n)
{
if(t[te] < k[ks])
{
l++;
}
te--;
ks++;
p++;
}
}
sum = (w -l) *200;
printf("%d/n",sum);
}
}