#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
using ll=long long;
typedef pair<int, int> P;

int main()
{
    int n; cin>>n;
    ll a[200010], b[200020];
    vector<P> v(n);
    for(int i=0; i<n; i++){
        cin>>a[i];
        v[i].first=a[i];
    }
    ll sb=0;
    for(int i=0; i<n; i++){
        cin>>b[i];
        sb+=b[i];
        v[i].second=b[i];
    }
    sort(v.begin(), v.end());
    for(int i=0; i<n; i++){
        a[i]=v[i].first, b[i]=v[i].second;
    }
    ll s=0;
    ll a0=a[0];
    for(int i=0; i<n; i++){
        s+=b[i];
        if(-sb+2*s>=0){
            a0=a[i];break;
        }
    }
    cout<<a0<<" ";
    ll ans=0;
    for(int i=0; i<n; i++){
        ans+=b[i]*abs(a[i]-a0);
    }
    cout<<ans<<endl;
    return 0;
}