#include <bits/stdc++.h>
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define ALL(v) (v).begin(), (v).end()
#define LLA(v) (v).rbegin(), (v).rend()
#define PB push_back
#define MP(a, b) make_pair((a), (b))
using namespace std;
template <class T> inline vector<T> make_vec(size_t a, T val) {
    return vector<T>(a, val);
}
template <class... Ts> inline auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
template <typename T> inline T read() {
    T t;
    cin >> t;
    return t;
}
template <typename T> inline vector<T> readv(size_t sz) {
    vector<T> ret(sz);
    rep(i, sz) cin >> ret[i];
    return ret;
}
template <typename... Ts> inline tuple<Ts...> reads() {
    return {read<Ts>()...};
}
template <typename T> struct edge {
    int to;
    T cost;
    edge(int t, T c) : to(t), cost(c) {}
};
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    auto A = readv<ll>(N);
    auto B = readv<ll>(N);
    vector<pll> P(N);
    rep(i, N) { P[i] = {A[i], B[i]}; }
    sort(ALL(P));
    vector<ll> Bsum(N + 1), ABsum(N + 1);
    rep(i, N) {
        Bsum[i + 1] = P[i].second + Bsum[i];
        ABsum[i + 1] = P[i].first * P[i].second + ABsum[i];
    }
    ll num = 0;
    ll res = LINF;

    auto f = [&](int k) {
        return (Bsum[k + 1] - (Bsum[N] - Bsum[k + 1])) * P[k].first -
               (ABsum[k + 1] - (ABsum[N] - ABsum[k + 1]));
    };
    for(int i = 0; i < N; i++) {
        cout << P[i].first << " " << f(i) << endl;
        if(res >= f(i)) {
            res = f(i);
            num = i;
        }
    }
    cout << P[num].first << " " << res << endl;
}