#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int N;
    cin >> N;
    pair<ll, ll> p[N];
    ll cnt = 0;
    ll A[N], B[N];
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
    for (int i = 0; i < N; i++) {
        cin >> B[i];
        cnt += B[i];
        p[i] = make_pair(A[i], B[i]);
    }
    sort(p, p + N);
    ll X = 0;
    ll m = 0;
    for (int i = 0; i < N; i++) {
        m += p[i].second;
        X = p[i].first;
        if (cnt / 2 <= m) break;
    }
    ll f = 0;
    for (int i = 0; i < N; i++) {
        f += p[i].second * abs(p[i].first - X);
    }
    cout << X << " " << f << "\n";

    return 0;
}