#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; int win = 0; for(int i = 1;i <= N;i++) { if(idx > N) break; if(l2[i] < l1[idx]) { p ++; idx++; win++; cout << l1[idx-1] << " " << l2[i] << endl; } } p -= (N - win); cout << p * 200 << endl; } }