#include <bits/stdc++.h> using namespace std; #define int long long int l1[2005],l2[2005]; bool cmp(int n1,int n2) { return n1 > n2; } signed main() { int N; while(cin >> N && N != 0) { for(int i = 1;i <= N;i++) cin >> l1[i]; for(int i = 1;i <= N;i++) cin >> l2[i]; int idx = 1; sort(l1+1,l1+1+N,cmp); sort(l2+1,l2+1+N,cmp); int p = 0; bool U[105]; memset(U,0,sizeof(U)); for(int i = 1;i <= N;i++) { bool flag = 0; bool flag2 = 1; for(int k = 1;k <= N;k++) { if(l1[i] > l2[k] && U[k] == 0) { flag = 1; l2[k] = 1; p += 200; U[k] = 1; break; } else if(l1[i] != l2[k] && U[k] == 0) flag2 = 0; } if(flag == 0 && flag2 == 0) { p -= 200; for(int k = 1;k <= N;k++) { if(U[k] == 0) { U[k] = 1; break; } } } } cout << p << endl; } }