#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;
map<int, int> cnt;
int mx = -1, num = 0;
vector<vector<int>> g(n + 1, vector<int>(n + 1));
for(int i = 1; i <= n; i++) {
cin >> g[i][1];
}
for(int j = 1; j <= n; j++) {
cin >> g[1][j];
}
for(int i = 2; i <= n; i++) {
for(int j = 2; j <= n; j++) {
g[i][j] = max({g[i][j-1], g[i-1][j]});
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j<= n; j++) {
cnt[g[i][j]]++;
if(cnt[g[i][j]] == mx and g[i][j] > num) num = g[i][j];
if(cnt[g[i][j]] > mx) {
mx = cnt[g[i][j]];
num = g[i][j];
}
}
}
cout << num << " " << cnt[num] << endl;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--)
solve();
return 0;
}
