#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;

int main() {
  int n;
  cin >> n;
  vector<pair<ll,ll>> p(n);
  ll sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> p[i].first;
  }
  for (int i = 0; i < n; i++) {
    cin >> p[i].second;
    sum += p[i].second;
  }
  sort(p.begin(), p.end());
  sum = (sum + 1) / 2;
  for (int i = 0; i < n; i++) {
    if (sum > p[i].second) sum -= p[i].second;
    else {
      sum = p[i].first;
      break;
    }
  }
  ll res = 0;
  for (int i = 0; i < n; i++) res += p[i].second * abs(p[i].first - sum);
  cout << sum << " " << res << endl;
  return 0;
}