#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
#include <cstring>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    int N;
    cin >> N;
    vector<int> A(N), B(N);
    map<int, int> mp;
    for(int i = 0; i < N; ++i){
        cin >> A[i];
        mp[A[i]] = -1;
    }
    for(int i = 0; i < N; ++i)  cin >> B[i];

    int K = 0;
    vector<int> xs;
    for(auto& it : mp){
        it.second = K++;
        xs.emplace_back(it.first);
    }
    vector<ll> sum(K + 1);
    for(int i = 0; i < N; ++i)  sum[mp[A[i]] + 1] += B[i];
    for(int i = 0; i < K; ++i)  sum[i + 1] += sum[i];

    int X = 0;
    for(int i = 0; i <= K; ++i){
        if(sum[i] * 2 >= sum[K]){
            X = i;
            break;
        }
    }
    X = xs[X];
    ll ans = 0;
    for(int i = 0; i < N; ++i)  ans += (ll)B[i] * abs(X - A[i]);
    cout << X << ' ' << ans << '\n';
}