#include <iostream>
#include <vector>
#include <map>
#include <atcoder/lazysegtree>

using namespace std;
using namespace atcoder;
using ll=long long;

ll op(ll a,ll b) {return a+b;}
ll e() {return 0LL;}
ll mapping(ll F,ll x) {return F+x;}
ll composition(ll F,ll G) {return F+G;}
ll id(){ return 0LL;}

int main(){
    ll n,dx=2001001,ans=0;
    cin>>n;

    vector<ll> a(n),b(n);
    lazy_segtree<ll,op,e,ll,mapping,composition,id> s(3001002);

    for(int i=0;i<n;i++) {cin>>a[i];a[i]+=dx;}
    for(int i=0;i<n;i++) cin>>b[i];
    
    for(int i=0;i<n;i++){
        ll ai=a[i],bi=b[i];
        s.apply(0,bi*ai);
        s.apply(1,ai+1,-bi);
        s.apply(ai+1,3001001,bi);
    }
    vector<ll> csum={s.get(0)};
    ll fmin=2001001001001001001;
    ll minx;
    for(ll i=0;i<3001001;i++){
        csum.push_back(csum[i]+s.get(i+1));
        ll f=csum[i+1];
        if(f<fmin){
            fmin=f;
            minx=i+1-dx;
        }
    }
    cout<<minx<<" "<<fmin<<endl;

    return 0;
}