#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<48);

int main() {
    cin>>N;
    vec a(N+1, (ll)2e+6), b(N+1, 0), ord(N+1);
    rep(i, N) cin>>a[i];
    rep(i, N) cin>>b[i];
    iota(ALL(ord), 0);
    sort(ALL(ord), [&](int x, int y){return a[x] < a[y];});
    ll res(0);
    rep(i, N) {
        int id(ord[i]), nx(ord[i+1]);
        res += b[nx] * (a[nx] - a[ord[0]]);
        b[nx] += b[id];
    }
    int res_id(-1);
    rep(i, N){
        int id(ord[i]), nx(ord[i+1]);
        if(b[id] > b[ord[N]] - b[id]) {res_id = id; break;}
        res += (a[nx] - a[id]) * (b[id] * 2 - b[ord[N]]);
    }
    cout<<a[res_id]<<' '<<res<<endl;
}