#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <cctype>
#include <numeric>
#include <bitset>
#include <functional>

using namespace std;

using ll =  long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;

constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {
    { 0, 1}, {-1, 0}, {0,-1}, {1, 0}
};

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int n; ll sb = 0;
    cin >> n;
    vector<Pll> ab(n);
    for(int i=0;i<n;++i) {
        cin >> ab[i].first;
    }
    for(int i=0;i<n;++i) {
        cin >> ab[i].second;
        sb += ab[i].second;
    }

    if(sb == 0) {
        cout << "0 0" << endl;
        return 0;
    }

    sort(ab.begin(), ab.end());
    ll x = 0;
    ll cnt = 0LL;
    for(int i=0;i<n;++i) {
        cnt += ab[i].second;
        if(cnt * 2 >= sb) {
            x = ab[i].first;
            break;
        }
    }

    ll ans = 0LL;
    for(int i=0;i<n;++i) {
        ans += ab[i].second * abs(x - ab[i].first);
    }

    cout << x << " " << ans << endl;
}