#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
const int MAXN = 1e6 + 5;
const int inf = (int)2e9 + 5;
const int infll = (int)4e18 + 5;
const int mod = (int)1e9 + 7;
void solve(){
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
map<int, int> mp;
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
for(int i = 1; i <= n; i++) {
cin >> b[i];
}
mp[a[1]] = 1;
for(int i = 2; i <= n; i++) {
int ind = lower_bound(b.begin() + 1, b.end(), a[i]) - b.begin();
if(b[ind] != a[i]) ind--;
mp[a[i]]+=ind;
}
for(int i = 2; i <= n; i++) {
int ind = lower_bound(a.begin() + 1, a.end(), b[i]) - a.begin() - 1;
mp[b[i]]+=ind;
}
int num = 0, mx = 0;
for(auto [k, v] : mp) {
if(v == mx) num = max(num, k);
if(v > mx) {
mx = v;
num = k;
}
}
cout << num << " " << mx << endl;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--)
solve();
return 0;
}
