#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n;
    cin >> n;
    vector<int> A(n), B(n);
    for (auto &&i : A) scanf("%d", &i);
    for (auto &&i : B) scanf("%d", &i);
    vector<int> o(n);
    iota(o.begin(),o.end(), 0);
    ll S = accumulate(B.begin(),B.end(), 0LL);
    sort(o.begin(),o.end(), [&](int x, int y){ return A[x] < A[y]; });
    ll val = -INF<ll>;
    for (auto &&i : o) {
        S -= B[i]*2;
        if(S <= 0) {
            val = A[i];
            break;
        }
    }
    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        ans += abs(A[i]-val)*B[i];
    }
    cout << val << " " << ans << "\n";
    return 0;
}