#include "bits/stdc++.h"
using namespace std;
//#include "atcoder/all"
//using namespace atcoder;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>istream&operator >>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;}
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;

signed main(){
	int N;
	cin >> N;
	vector<int>a(N), b(N);
	cin >> a >> b;

	int l = -1e7, r = 1e7;
	auto f = [&](int x) {
		int ret = 0;
		REP(i, N) {
			ret += abs(x - a[i]) * b[i];
		}
		return ret;
	};
	REP(i, 60) {
		int m1 = (l + l + r) / 3;
		int m2 = (l + r + r) / 3;
		if(f(m1) < f(m2)) {
			r = m2;
		} else {
			l = m1;
		}
	}
	int ans = INF, idx = -1;
	FOR(i, l - 30, l + 30) if(CHMIN(ans, f(i))) idx = i;
	out(idx, ans);
}