#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <map>

using lint = long long;

template <class T>
std::map<T, int> compress(std::vector<T>& v) {
    std::sort(v.begin(), v.end());
    v.erase(std::unique(v.begin(), v.end()), v.end());

    std::map<T, int> rev;
    for (int i = 0; i < (int)v.size(); ++i) rev[v[i]] = i;
    return rev;
}

constexpr lint XINF = 1 << 20;

void solve() {
    int n;
    std::cin >> n;

    std::vector<lint> xs(n), ys(n);
    for (auto& x : xs) std::cin >> x;
    for (auto& y : ys) std::cin >> y;

    auto eval = [&](lint x) {
        lint ret = 0;
        for (int i = 0; i < n; ++i) {
            ret += std::abs(xs[i] - x) * ys[i];
        }
        return ret;
    };

    auto zs = xs;
    zs.push_back(-XINF);
    zs.push_back(XINF);
    compress(zs);

    int m = zs.size();
    int ok = -1, ng = m;
    while (ng - ok > 1) {
        int mid = (ok + ng) / 2;
        if (eval(zs[mid] - 1) > eval(zs[mid])) {
            ok = mid;
        } else {
            ng = mid;
        }
    }

    std::cout << zs[ok] << " " << eval(zs[ok]) << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(10);

    solve();

    return 0;
}