#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using P = pair<ll, ll>;
using T = tuple<ll, ll, double>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<ll> a(n), b(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < n; i++) cin >> b[i];
    auto f = [&](ll a, ll b){
        double x = sqrt((double)a/(double)b);
        return max(x, 1.0);
    };
    vector<T> vt;
    function<void()> optimize = [&](){
        if(vt.size() <= 1) return;
        auto [a1, b1, x1] = vt.back();
        auto [a0, b0, x0] = vt[vt.size()-2];
        if(x1 > x0){
            vt.pop_back(); vt.pop_back();
            vt.push_back(T(a0+a1, b0+b1, f(a0+a1, b0+b1)));
            optimize();
        }else{
            double t0 = (double)a0/x0 + (double)b0*x0;
            double t1 = (double)a1/x1 + (double)b1*x1;

            double aa = a0+a1, bb = b0+b1, xx = f(aa, bb);
            double tt = (double)aa/xx + (double)bb*xx;
            if(tt < t0+t1){
                vt.pop_back(); vt.pop_back();
                vt.push_back(T(aa, bb, xx));
                optimize();
            }
        }
    };
    for(int i = n-1; i >= 0; i--){
        ll aa = a[i], bb = b[i], xx = f(a[i], b[i]);
        vt.push_back(T(aa, bb, xx));
        optimize();
    }
    double ans = 0.0;
    for(auto [a, b, x]: vt){
        // cout << a << ' ' << b << ' ' << x << endl;
        ans += (double)a/x + (double)b*x;
    }
    cout << ans << endl;
}