#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
ll A[202020],B[202020],C[202020];

ll hoge(ll v) {
	ll ret=0;
	int i;
	FOR(i,N) ret+=B[i]*abs(v-A[i]);
	return ret;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	vector<int> V;
	FOR(i,N) cin>>A[i], V.push_back(A[i]);
	FOR(i,N) cin>>B[i];
	sort(ALL(V));
	V.erase(unique(ALL(V)),V.end());
	int L=0,R=V.size()-1;
	while(R-L>=3) {
		int m1=(L*2+R)/3;
		int m2=(R*2+L)/3;
		ll v1=hoge(V[m1]);
		ll v2=hoge(V[m2]);
		if(v1<=v2) R=m2;
		if(v2<=v1) L=m1;
	}
	
	int mi=V[L];
	ll ret=1LL<<61;
	for(i=L;i<=R;i++) {
		ll v=hoge(V[i]);
		if(v<ret) {
			mi=V[i];
			ret=v;
		}
	}
	cout<<mi<<" "<<ret<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}