#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <deque>
#include <map>
#include <chrono>
#include <random>
#include <bitset>
#include <tuple>
#define SZ(x) int(x.size())
#define FR(i,a,b) for(int i=(a);i<(b);++i)
#define FOR(i,n) FR(i,0,n)
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define A firsts
#define B second
#define mp(a,b) make_pair(a,b)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef unsigned __int128 U128;
typedef __int128 I128;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;
using namespace std;
const LL MAXN=505;
LL g[MAXN][MAXN];
map<LL,LL> cnt;
signed main(){
FAST;
LL n; cin>>n;
FR(i,1,n+1) cin>>g[1][i];
FR(i,1,n+1) cin>>g[i][1];
FR(i,2,n+1) FR(j,2,n+1) g[i][j]=max(g[i-1][j], g[i][j-1]);
LL c=0,mx=0;
FR(i,1,n+1) FR(j,1,n+1){
cnt[g[i][j]]++;
if (cnt[g[i][j]]==mx) c=max(c,g[i][j]);
else if (cnt[g[i][j]]>mx){
c=g[i][j];
mx=cnt[g[i][j]];
}
}
cout<<c<<" "<<mx;
return 0;
}
