#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

using namespace std;
using ll = long long;
using ull = unsigned long long;

ll mod = 1e9 + 7;

int main(){	
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	vector<double> a(n) , b(n);
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	for(int i = 0; i < n; i++){
		cin >> b[i];
	}
	sort(a.begin() , a.end());
	double c = 0;
	if(n % 2 == 1){
		c = a[n / 2];
	}else{
		c = a[n / 2] + a[n / 2 - 1];
		c /= 2;
	}
	long double ans = 0;
	for(int i = 0; i < n; i++){
		ans += b[i] * abs(c - a[i]);
	}
	cout << c << " " << ans << endl;
	return 0;
}