#include <iostream> #include <algorithm> using namespace std; int a[20100], b[20100]; int main() { int n; cin >> n; while(n) { for(int i = 1; i <= n; i++) cin >> b[i]; for(int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); sort(b + 1, b + n + 1); int l1 = 1, r1 = n, l2 = 1, r2 = n, ans = 0; for(int i = 1; i <= n; i++) { if(a[r1] < b[r2]) {r1--; r2--; ans += 200;} else if(a[l1] < b[l2]) {l1++; l2++; ans += 200;} else if(a[r1] > b[r2]) {l2++; l1--; ans -= 200;} } cout << ans << endl; cin >> n; } return 0; }