// author : anhtun_hi , nqg
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define reset(h, v)    memset(h, v, sizeof h)
#define Forv(i, a)     for(auto& i : a)
#define For(i, a, b)   for(int i = a; i <= b; ++i)
#define Ford(i, a, b)  for(int i = a; i >= b; --i)
#define c_bit(i)     __builtin_popcountll(i)
#define Bit(mask, i)    ((mask >> i) & 1LL)
#define onbit(mask, i)  ((mask) bitor (1LL << i))
#define offbit(mask, i) ((mask) &~ (1LL << i))
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
using namespace std;
namespace std {
    template <typename T, int D>
    struct _vector : public vector <_vector <T, D - 1>> {
        static_assert(D >= 1, "Dimension must be positive!");
        template <typename... Args>
        _vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
    };
    template <typename T> struct _vector <T, 1> : public vector <T> {
        _vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
    };
    template <class A, class B> bool minimize(A &a, B b){return a > b ? a = b, true : false;}
    template <class A, class B> bool maximize(A &a, B b){return a < b ? a = b, true : false;}
}
const int dx[] = {0, 0, +1, -1}, dy[] = {-1, +1, 0, 0}, LOG = 20, base = 311, inf = 1e9 + 5;
const int MAXN = 1e6 + 5;
const  ll  mod = 1e9 + 7;
const  ll   oo = 1e15;

#define int long long

int n, a[MAXN], c[MAXN];
ll dp[MAXN], mx;

struct point {
    ll x, y;
    ll dot(point p) {
        return x * p.x + y * p.y;
    }
    ll cross(point p) {
        return x * p.y - y * p.x;
    }
    point conj() {
        return {-y, x};
    }
    point vt(point p) {
        return {x - p.x, y - p.y};
    }
};

vector<point> hull, vec;

void add(ll a, ll b) {
    auto p = point{a, b};
    while (vec.size() >= 1 && vec.back().dot(p.vt(hull.back())) >= 0) { // <= 0 neu max
        vec.pop_back();
        hull.pop_back();
    }
    if (!hull.empty())
        vec.push_back(p.vt(hull.back()).conj());
    hull.push_back(p);
}

ll get(ll x) {
    if(hull.empty()) return oo;
    auto query = point{x, 1};
    auto it = lower_bound(vec.begin(), vec.end(), query, [](point a, point b) {
        return a.cross(b) > 0; // <0 neu max
    });
    return query.dot(hull[it - vec.begin()]);
}

void clear(){
    hull.clear();
    vec.clear();
}

int pre[MAXN], suf[MAXN];

void solve(int l, int r)
{
    if (l == r) return;
    int mid = l + r >> 1;
    solve(l, mid);

    pre[mid] = 0; For(i, mid + 1, r) pre[i] = max(pre[i - 1], c[i]);
    suf[mid] = 0; Ford(i, mid - 1, l) suf[i] = max(suf[i + 1], c[i + 1]);

    clear();
    mx = 0;
    for (int i = mid + 1, j = mid + 1; i <= r; ++i){
        while (j > l && suf[j - 1] <= pre[i]) {
            --j;
            add(j, dp[j]);
        }
        minimize(dp[i], get(-pre[i]) + 1ll * i * pre[i] + a[i]);
    }

    clear();
    mx = 0;
    for (int i = r, j = l - 1; i > mid; --i){
        while (j < mid && suf[j + 1] >= pre[i]){
            ++j;
            add(suf[j], dp[j] - 1ll * j * suf[j]);
        }
        minimize(dp[i], get(i) + a[i]);
    }
    solve(mid + 1, r);
}

void Solve() {
    cin >> n;
    For(i, 1, n) cin >> c[i];
    For(i, 1, n - 1) cin >> a[i];
    fill(dp, dp + n + 1, oo);
    dp[0] = 0;
//    For(i, 1, n){
//        ll ma = 0;
//        Ford(j, i - 1, 0){
//            maximize(ma, c[j]);
//            minimize(dp[i], dp[j] + (i - j) * ma + a[i]);
//        }
//    }
    solve(0, n);
    cout << dp[n] << '\n';
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    if(fopen("a.inp", "r")) {
        freopen("a.inp", "r", stdin);
        freopen("a.out", "w", stdout);
    }

    int t = 1;
//    cin >> t;
    while(t --) Solve();

    return 0;
}