#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

int main(){
    int N;
    cin >> N;
    pll p[N];
    rep(i, N) cin >> p[i].first;
    rep(i, N) cin >> p[i].second;
    sort(p, p+N);

    ll dp1[N+1], dp2[N+1];
    dp1[0] = dp2[N] = 0;
    rep(i, N) dp1[i+1] = dp1[i]+p[i].second;
    rep3(i, N-1, 0) dp2[i] = dp2[i+1]+p[i].second;
    int ptr = 0;
    while(ptr < N && dp1[ptr] < dp2[ptr+1]) ptr++;

    ll ans = p[ptr].first, sum = 0;
    for(auto &e: p) sum += e.second*abs(ans-e.first);

    cout << ans << ' ' << sum << endl;
}