#include <bits/stdc++.h>
#include <experimental/random>
#include <random>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
using ld = long double;
using ll = long long;
const ll INF = 1e18, MOD = 1e9 + 7;
void solve();
signed main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int q = 1;
//cin >> q;
while (q--) {
solve();
}
}
void solve() {
ll n;
cin >> n;
vector<ll> a(n);
map<ll, ll> cnt;
for (int i = 0; i < n; i++) {
cin >> a[i];
cnt[a[i]]++;
}
vector<ll> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
cnt[b[i]]++;
}
for (int i = 2; i < n; i++) {
b[i] = max(b[i], b[i - 1]);
}
cnt[a[0]]--;
for (int i = 2; i < n; i++) {
a[i] = max(a[i], a[i - 1]);
}
ll l = 1;
ll idx = 1;
while (l < n) {
ll r = l;
while (r < n && a[r] == a[l]) {
r++;
}
ll c = r - l;
while (idx < n && b[idx] <= a[l]) {
idx++;
}
cnt[a[l]] += c * (idx - 1);
l = r;
}
l = 1, idx = 1;
while (l < n) {
ll r = l;
while (r < n && b[r] == b[l]) {
r++;
}
ll c = r - l;
while (idx < n && a[idx] < b[l]) {
idx++;
}
cnt[b[l]] += c * (idx - 1);
l = r;
}
ll val = a[0];
for (auto [key, c]: cnt) {
if (c >= cnt[val]) {
val = key;
}
}
cout << val << ' ' << cnt[val];
}
