#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

const ll INF=1e18;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin>>N;
  vector<ll> A(N),B(N);
  rep(i,N) cin>>A[i];
  rep(i,N) cin>>B[i];

  vector<ll> X=A;
  sort(all(X));
  X.erase(unique(all(X)),X.end());
  int V=X.size();

  auto calc = [&](ll x){
    ll res=0;
    rep(i,N) res+=B[i]*abs(x-A[i]);
    return res;
  };

  int low=0,high=V-1;
  while(low+2<high){
    int lef=(low+low+high)/3;
    int rig=(low+high+high)/3;

    ll lv=calc(X[lef]);
    ll rv=calc(X[rig]);
    if(lv<rv) high=rig;
    else low=lef; 
  }

  ll ans=INF;
  int mit=0;
  while(low<=high){
    ll res=calc(X[low]);
    if(ans>res){
      ans=res;
      mit=low;
    }
    low++;
  }
  cout<<X[mit]<<" "<<ans<<endl;

  return 0;
}