#include <bits/stdc++.h> using namespace std; int l1[2005],l2[2005]; bool cmp(int n1,int n2) { return n1 > n2; } int main() { int N; while(cin >> N && N != 0) { if(N == 0) break; else { 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); long long p = 0; for(int i = 1;i <= N;i++) { if(idx > N) break; if(l2[i] < l1[idx]) { p += 200; idx++; } else if(l2[i] > l1[idx]) { p -= 200; } } cout << p << endl; } } }