uva 1344

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <string>
#include <cstring>
#include <algorithm>
#include <iostream>
#define maxn 110
#define INF 0x7fffffff
#define inf 10000000
#define MOD 1000000007
#define ull unsigned long long
#define ll long long
using namespace std;

int a[1010], b[1010];

int main()
{
int n;
while(scanf("%d",&n) && n)
{
for(int i = 0 ; i < n; i++) scanf("%d",&a[i]);
for(int i = 0 ; i < n; i++) scanf("%d",&b[i]);
sort(a, a+n);
sort(b, b+n);
int tjmin = 0, tjmax = n-1, qwmin = 0, qwmax = n-1;
int sum = 0;
while(tjmin <= tjmax)
{
if(a[tjmax] > b[qwmax])
{
++ sum;
-- tjmax;
-- qwmax;
}
else if(a[tjmin] > b[qwmin])
{
++ sum;
++ tjmin;
++ qwmin;
}
else
{
if(a[tjmin] < b[qwmax]) -- sum;
-- qwmax;
++ tjmin;
}
}
printf("%d\n",sum*200);
}
return 0;
}