#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

int N;
pair<LL, LL> A[200000];

int main() {
	cin >> N;
	rep(i, N) cin >> A[i].first;
	rep(i, N) cin >> A[i].second;

	sort(A, A + N);
	LL sumB = 0; rep(i, N) sumB += A[i].second;
	LL tgB = sumB / 2;

	LL X = -1;
	rep(i, N) {
		tgB -= A[i].second;
		if (tgB <= 0) { X = A[i].first; break; }
	}

	LL fX = 0;
	rep(i, N) fX += abs(A[i].first - X) * A[i].second;
	cout << X << " " << fX << endl;

	return 0;
}