/*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << "\n"

void solve(){
    ll N;
    cin >> N;
    ll A[200010], B[200010];
    rep(i,0,N) cin >> A[i];
    rep(i,0,N) cin >> B[i];
    vector<lpair> lp;
    rep(i,0,N) lp.push_back({A[i], B[i]});
    sort(lp.begin(), lp.end());
    rep(i,0,N){
        A[i] = lp[i].first;
        B[i] = lp[i].second;
    }
    ll plus_val = 0, minus_val = 0;
    rep(i,1,N) plus_val += B[i];
    ll ans = 0;
    rep(i,0,N){
        ans += B[i] * abs(A[i] - A[0]);
    }
    ll cur = ans, min_pos = A[0];
    // print(cur);
    rep(i,1,N){
        cur -= plus_val * (A[i] - A[i-1]);
        minus_val += B[i-1];
        cur += minus_val * (A[i] - A[i-1]);
        if(cur < ans){
            ans = cur;
            min_pos = A[i];
        }
        ans = min(ans, cur);
        plus_val -= B[i];
    }
    print(min_pos,ans);

    // ll ans2 = INF;
    // rep(i,0,N){
    //     ll r = 0;
    //     rep(j,0,N) r += B[j] * abs(A[j] - A[i]);
    //     ans2 = min(ans2, r);
    // }
    // print(ans2);


}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}