#include<bits/stdc++.h>
using namespace std;
int n;
int a[2001];
int b[2001];
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >q;
queue<pair<int,int> >q2;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		q.push(make_pair(a[i],1));
	}
	for(int i=1;i<=n;i++){
		cin>>b[i];
		q.push(make_pair(b[i],0));
	}
	int ans=0;
	while(!q.empty()){
		pair<int,int> x=q.top();
		if(x.second==1){
			ans-=200;
			q.pop();
		}else{
			while(!q.empty()&&q.top().second==0){
				q2.push(q.top());
				q.pop();
				if(q.top().second==1){
					if(q.top().first>x.first){
						ans+=200;
					}
					q.pop();
					//break;
				}
			}
			while(!q2.empty()){
				q.push(q2.front());
				q2.pop();
			}
			q.pop();
		}
	}
	cout<<ans;
	return 0;
}