#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_
void debug_out() {cerr << endl;}
template<typename Head,typename... Tail> void debug_out(Head H,Tail... T){cerr << ' ' << H; debug_out(T...);}
#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:",debug_out(__VA_ARGS__)
#define dump(x) cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << endl;
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
#define rep(i,n) for (int i = 0; i < (int)(n); i ++)
#define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--i)
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;// = 998244353;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int N; cin >> N;
    vector<PL> A(N);
    rep(i,N) cin >> A[i].first;
    rep(i,N) cin >> A[i].second;

    sort(A.begin(),A.end());
    vector<ll> B(N+1,0);
    rep(i,N) B[i+1] = B[i] + A[i].second;
    int med = B[N]/2 + 1;
    ll a = 0;
    rep(i,N) {
        if (B[i+1] >= med) {
            a = A[i].first;
            break;
        }
    }
    ll ans = 0;
    rep(i,N) {
        ans += A[i].second*abs(a - A[i].first);
    }
    cout << a << ' ' << ans << '\n';
    return 0;
}