#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

const ll INF=1e6+1;

const double eps=1e-9;

int main(){
    ll n;
    cin >> n;
    vector<ll> a(n),b(n);
    map<ll,ll> m;
    rep(i,n){
        cin >> a[i];
    }
    ll sum=0;
    rep(i,n){
        cin >> b[i];
        m[a[i]]+=b[i];
        sum+=b[i];
    }
    ll cnt=0;
    ll val=0;
    for(auto [x,y]:m){
        cnt+=y;
        if(cnt>=sum/2){
            val=x;
            break;
        }
    }
    ll ans=0;
    rep(i,n){
        ans+=b[i]*abs(a[i]-val);
    }
    cout << val << " " << ans << endl;
    return 0;
}