/*
address:https://vjudge.net/problem/Yukicoder-704

*/
/*
address:https://vjudge.net/problem/Yukicoder-703
AC 2025/3/21 16:02
*/
#include<bits/stdc++.h>
using namespace std;
const int N = 6e5 + 5;
const int V = 1e5 + 5;
struct line {
    int k, b;
}li[N];
struct LiChaoSegmentTree {
#define ls (id << 1)
#define rs (id << 1 | 1)
#define mid (l + r >> 1)
    int idl[V << 2];
    inline int cmp(int i, int j, int x) {
        int y0 = li[i].k * x + li[i].b, y1 = li[j].k * x + li[j].b;
        if (y0 <= y1) return i;
        else return j;
    }
    inline void update(int id, int l, int r, int j) {
        int& i = idl[id];
        if (i == j) return;
        if (cmp(i, j, mid) == j) swap(i, j);
        if (cmp(i, j, l) == j) update(ls, l, mid, j);
        if (cmp(i, j, r) == j) update(rs, mid + 1, r, j);
    }
    inline void modify(int id, int l, int r, int L, int R, int j) {
        if (l >= L && R >= r) {
            update(id, l, r, j);
            return;
        }
        if (L <= mid) modify(ls, l, mid, L, R, j);
        if (R > mid) modify(rs, mid + 1, r, L, R, j);
    }
    inline int query(int id, int l, int r, int x) {
        if (l == r) return idl[id];
        int ret = 0;
        if (x <= mid) ret = query(ls, l, mid, x);
        else ret = query(rs, mid + 1, r, x);
        return cmp(ret, idl[id], x);
    }
}LCSGT;
int n;
int a[N], x[N], y[N];
int dp[N];
int main() {
    scanf("%d", &n);
    for (int i = 1;i <= n;++i) scanf("%d", &a[i]);
    for (int i = 1;i <= n;++i) scanf("%d", &x[i]);
    for (int i = 1;i <= n;++i) scanf("%d", &y[i]);
    li[0] = { -1, dp[0] };
    li[1] = { 1, dp[0] };
    LCSGT.modify(1, 0, V - 5, x[1] + 1, V - 5, 1);
    for (int i = 1;i <= n;++i) {
        int j = LCSGT.query(1, 0, V - 5, a[i]);
        dp[i] = abs(x[j + 2 >> 1] - a[i]) + y[j + 2 >> 1] + dp[j >> 1];
        li[i << 1] = { -1, dp[i] };
        li[i << 1 | 1] = { 1, dp[i] };
        LCSGT.modify(1, 0, V - 5, 0, x[i + 1], i << 1);
        LCSGT.modify(1, 0, V - 5, x[i + 1] + 1, V - 5, i << 1 | 1);
    }
    printf("%d\n", dp[n]);
    return 0;
}