#include <bits/stdc++.h> #define int long long using namespace std; const int N = 2000 + 5; int n, t, a[N], b[N], l1, l2, r1, r2, ans; signed main() { while(~scanf("%d", &n) && n) { for (int i=1; i<=n; i++) scanf("%d", b+i); for (int i=1; i<=n; i++) scanf("%d", a+i); sort(a+1, a+1+n); sort(b+1, b+1+n); l1=1, l2=1, r1=n, r2=n, ans=0; for (int cnt=1; cnt<=n; cnt++) { if (a[r1] < b[r2]) { r1--, r2--; ans += 200; } else if (a[l1] < b[l2]) { l1++, l2++; ans += 200; } else if (a[r1] > b[l2]) { l2++, r1--; ans -= 200; } } printf("%d\n", ans) ; } return 0; }