#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 005; int x[N], y[N]; int a[N]; int main() { int n; while (cin >> n) { memset(a, 0, sizeof(a)); if (!n) break; int tmp1 = 0; for (int i = 1; i <= n; i++) cin >> x[i]; for (int i = 1; i <= n; i++) cin >> y[i]; sort (x + 1, x + n + 1); sort (y + 1, y + n + 1); for (int i = 1; i <= n; i++) { int tmp = upper_bound(x + 1, x + n + 1, y[i]) - x; if (tmp == n + 1) { for (int j = 1; j <= n; j++) if (!a[j]) { a[j] = !a[j]; if (x[j] != y[i]) tmp1 -= 200; break; } } else { int tmp12 = false; for (int j = tmp; j <= n; j++) if (!a[j]) { a[j] = !a[j]; tmp1 += 200; tmp12 = true; break; } if (tmp12 == false) for (int j = 1; j <= n; j++) if (!a[j]) { a[j] = !a[j]; if (x[j] != y[i]) tmp1 -= 200; break; } } } cout << tmp1 << endl; } }