/* -*- coding: utf-8 -*-
 *
 * 1251.cc:  No.1251 絶対に間違ってはいけない最小化問題 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const long long LINF = 1LL << 62;

/* typedef */

typedef long long ll;
typedef pair<int,int> pii;

/* global variables */

pii ps[MAX_N];
ll ass[MAX_N + 1], bss[MAX_N + 1];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++) scanf("%d", &ps[i].first);
  for (int i = 0; i < n; i++) scanf("%d", &ps[i].second);
  sort(ps, ps + n);

  for (int i = 0; i < n; i++) {
    ass[i + 1] = ass[i] + (ll)ps[i].first * ps[i].second;
    bss[i + 1] = bss[i] + ps[i].second;
  }

  ll minf = LINF;
  int minx = -1;
  for (int i = 0; i < n; i++) {
    int x = ps[i].first;
    ll f = (bss[i] * x - ass[i]) + ((ass[n] - ass[i]) - (bss[n] - bss[i]) * x);
    if (minf > f) minf = f, minx = x;
  }

  printf("%d %lld\n", minx, minf);
  return 0;
}