##1052
#include<bits/stdc++.h>
using namespace std;
int n,tj[1005],ki[1005];
int tf,tl,kf,kl,win,lose;
bool cmp(int a,int b){
return a>b;
}
int main(){
while(cin>>n){
if(n==0)break;
for(int i=0;i<n;i++) cin>>tj[i];
for(int i=0;i<n;i++) cin>>ki[i];
sort(tj,tj+n,cmp);
sort(ki,ki+n,cmp);
win=lose=0;
tf=kf=0;
tl=kl=n-1;
for(int i=0;i<n;i++){
if(tj[tf]>ki[kf]){
win++;
tf++;
kf++;
}
else if(tj[tl]>ki[kl]){
win++;
tl--;
kl--;
}
else if(tj[tl]<ki[kf]){
lose++;
tl--;
kf++;
}
}
int sum=200*(win-lose);
cout<<sum<<endl;
}
}