#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(nullptr);
#define s(x) x.size()
#define sort(x) sort(x.begin(), x.end())
#define rsort(x) sort(x.rbegin(), x.rend())
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define INF 1e9
#define INFL 1e18
#define rep(a, b) for (int a = 0; a < b; a++)
using ll = long long;
using pii = pair<int, int>;
void solve()
{
ll n;
cin >> n;
vector<ll> v1(n), v2(n);
pair<ll, ll> maks;
map<ll, ll> mapa;
for (ll i = 0; i < n; i++)
{
cin >> v1[i];
if (i == 0)
maks = {v1[i], 1};
if (i > 1){
if(v1[i]<v1[i-1]) {
mapa[v1[i]]++;
mapa[v1[i-1]]--;
if (maks.second < mapa[v1[i]])
maks = {v1[i], mapa[v1[i]]};
else if (maks.second == mapa[v1[i]])
maks.first = max(maks.first, v1[i]);
}
v1[i] = max(v1[i], v1[i - 1]);
}
}
for (ll i = 0; i < n; i++)
{
cin >> v2[i];
if (i > 1){
v2[i] = max(v2[i], v2[i - 1]);
if(v2[i]<v2[i-1]) {
mapa[v2[i]]++;
mapa[v2[i-1]]--;
if (maks.second < mapa[v2[i]])
maks = {v2[i], mapa[v2[i]]};
else if (maks.second == mapa[v2[i]])
maks.first = max(maks.first, v2[i]);
}
}
}
mapa[v1[0]]++;
for (ll i = 1; i < n; i++)
{
ll l = 0, p = n - 1;
while (l < p)
{
ll sr = (l + p + 1) / 2;
if (v2[sr] <= v1[i])
l = sr;
else
p = sr - 1;
}
// if(v2[l]>v1[i]) l--;
// cout << l+1 << endl;
mapa[v1[i]] += l + 1;
if (maks.second < mapa[v1[i]])
maks = {v1[i], mapa[v1[i]]};
else if (maks.second == mapa[v1[i]])
maks.first = max(maks.first, v1[i]);
// cout << l << endl;
}
// cout << "-----" << endl;
for (ll i = 1; i < n; i++)
{
ll l = 0, p = n - 1;
while (l < p)
{
ll sr = (l + p + 1) / 2;
if (v1[sr] < v2[i])
l = sr;
else
p = sr - 1;
}
// cout << l+1 << endl;
mapa[v2[i]] += l + 1;
if (maks.second < mapa[v2[i]])
maks = {v2[i], mapa[v2[i]]};
else if (maks.second == mapa[v2[i]])
maks.first = max(maks.first, v2[i]);
// cout << l << endl;
}
// for (ll i = 0; i < n; i++) {
// cout << v1[i] << ' ';
// }
// cout << endl;
cout << maks.first << ' ' << maks.second << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
