#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;

using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;

template <class T> inline T chmax(T &a, const T b) {return a = (a < b) ? b : a;}
template <class T> inline T chmin(T &a, const T b) {return a = (a > b) ? b : a;}

constexpr int MOD = 1e9 + 7;
constexpr int inf = 1e9;
constexpr long long INF = 1e18;

#define all(a) (a).begin(), (a).end()

int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

int n;
vector<int> a(1000010), b(1000010);

double solve(double x){
    double cur = 0;
    for(int i=0; i<n; i++){
        cur += b[i] * abs(x - a[i]);
    }

    return cur;
}

pair<double, double> ternary_search(double l, double r){
    double left = l, right = r;

    // calculate minimum value
    for(int i=0; i<1000; i++){
        if(solve((left * 2 + right) / 3) < solve((left + right * 2) / 3)){
            right = (left + right * 2) / 3;
        }
        else{
            left = (left * 2 + right) / 3;
        }
    }

    return make_pair((left + right) * 0.5, solve((left + right) * 0.5));
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

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

    if(n == 1){
        cout << a[0] << " " << 0 << endl;
        return 0;
    }

    pair<double, double> ans = ternary_search(-inf, inf);

    cout << ans.first << " " << ans.second << endl;

    return 0;
}