#include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <map>
#include <algorithm>
#include <queue>
#include <cmath>
#include <numeric>
#include <set>
#include <climits>

using namespace std;
struct aaa{aaa(){cin.tie(nullptr); ios::sync_with_stdio(false); cout<<fixed<<setprecision(20);};}aaa;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
#define debug(v) {cerr<<"\033[1;36m[debug]\033[m "<<#v<<" : "<<v<<endl;}

using int64 = long long;

int main() {
    int n;
    cin >> n;
    vector a(n, 0);
    vector b(n, 0);

    for (int i=0; i<n; i++) cin >> a[i];
    for (int i=0; i<n; i++) cin >> b[i];

    double l = 0;
    double r = INT_MAX;

    double pre = LONG_MAX;
    for (int i=0; i<100; i++) {
        if (r < l) break;
        double ll = (l+l+r) / 3;
        double rr = (l+r+r) / 3;

        double suml = 0;
        double sumr = 0;
        for (int j=0; j<n; j++) {
            suml += b[j] * abs(ll - a[j]);
            sumr += b[j] * abs(rr - a[j]);
        }

        if (suml < sumr) {
            r = rr;
        } else {
            l = ll;
        }
    }

    double sum = 0;
    for (int i=0; i<n; i++) {
        sum += b[i] * abs(l - a[i]);
    }
    cout << l << " " << sum << endl;
}