#include<iostream>using namespace std;int a[1001];int b[1001];int cmp(const void *a,const void *b){return *(int *)b-*(int *)a;}int main(){int n,th,qh,ts,qs,win;while(cin>>n && n){for(int i=0;i<n;++i)cin>>a[i];for(i=0;i<n;++i)cin>>b[i];qsort(a,n,sizeof(int),cmp);qsort(b,n,sizeof(int),cmp);th=qh=win=0;ts=qs=n-1;while(th<=ts){if(a[th]>b[qh]){th++;qh++;win++;}else if(a[th]<b[qh]){ts--;qh++;win--;}else {if(a[ts]>b[qs]){ts--;qs--;win++;}else if(a[ts]<b[qs]){ts--;qh++;win--;}else{if(a[th]==b[qs])break;else{ts--;qh++;win--;}}}}cout<<win*200<<endl;}return 0;}
