#include <iostream>
#define I_hate_C24ZhengFujia return
using namespace std;
int n,x,y,sum = 0,l1 = 1,l2 = 1,r1,r2;
int a[2001],b[2001];
int main(){
	cin >> n;
	r1 = r2 = n;
	for (int i = 1;i <= n;i++)cin >> a[i];
	for (int i = 1;i <= n;i++)cin >> b[i];
	for (int i = 1;i <= n;i++){
		for (int j = 1;j <= n + 1 - i;j++){
			if (a[j] < a[j + 1])swap (a[j],a[j + 1]);
			if (b[j] < b[j + 1])swap (b[j],b[j + 1]);
		}
	}
	for (int i = 1;i <= n;i++){
		x = a[r1];
		y = b[r2];
		if (x > y){
			sum += 200;
			r1--;
			r2--;
		}
		else{
			if (a[l1] > b[l1]){
				sum += 200;
				l1++;
				l2++;
			}
			else if (a){
				sum -= 200;
				r1--;
				l2++;
			}
		}
	}
	cout << sum;
//	system ("pause");
	I_hate_C24ZhengFujia 0;
}

#include <iostream>
#include <vector>
using namespace std;

int n,maxn,a[101];
bool k[100005];
void oushai(){
	vector <int> v;
	for (int i = 2;i < maxn;i++){
		if ()
			 
	}
	return;
}
int main(){
	cin >> n;
	for (int i = 1;i <= n;i++){
		cin >> a[i];
		if (a[i] > maxn)maxn = a[i];
	}
	oushai();
	return 0;
}