uva1344

1.田忌最慢的马 < 齐王最慢的马 肯定要输一把 田忌最慢的马消耗掉齐王最快的马
2.田忌最慢的马 > 齐王最慢的马 稳赢 用最慢的消耗齐王最慢的 赢一把
3.田忌最慢的马 = 齐王最慢的马
田忌最快的马 > 齐王最快的马 赢一把
否则用最慢的马 消耗齐王最快的马 输一把 可能 和局

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 1007;
int n, a[maxn], b[maxn];
int main()
{
    
	while (cin >> n && n) {
    
		for (int i = 0; i < n; i++) cin >> a[i];
		for (int i = 0; i < n; i++) cin >> b[i];
		sort(a, a + n);
		sort(b, b + n);
		int ans = 0;
		for (int l = 0, r = n - 1, l1 = 0, r1 = n - 1; l <= r && l1 <= r1;) {
    
			if (a[l] > b[l1])l++, l1++, ans++;
			else if (a[l] < b[l1])l++, r1--, ans--;
			else if (a[r] > b[r1])r--, r1--, ans++;
			else ans -= a[l] != b[r1], l++, r1--;
		}
		cout << ans * 200 << endl;
	}
	return 0;
}