#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<int> B(N);
  for (int i = 0; i < N; i++){
    cin >> B[i];
  }
  vector<pair<int, int>> P(N);
  for (int i = 0; i < N; i++){
    P[i] = make_pair(A[i], B[i]);
  }
  sort(P.begin(), P.end());
  long long sum = 0;
  for (int i = 0; i < N; i++){
    sum += B[i];
  }
  int X = 0;
  long long sum2 = 0;
  for (int i = 0; i < N; i++){
    sum2 += P[i].second;
    if (sum2 * 2 >= sum){
      X = P[i].first;
      break;
    }
  }
  long long f = 0;
  for (int i = 0; i < N; i++){
    f += (long long) B[i] * abs(X - A[i]);
  }
  cout << X << ' ' << f << endl;
}