#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;
const int inf = 1e9;

int n, a[N], b[N];
int Max[N << 2], lazy[N << 2];

void build(int s = 1, int l = 1, int r = n + n - 1){
    if (l == r){
        Max[s] = a[l];
        return;
    }

    int mid = l + r >> 1;

    build(s << 1, l, mid);
    build(s << 1 | 1, mid + 1, r);

    Max[s] = max(Max[s << 1], Max[s << 1 | 1]);
}

void update(int u, int v, int val, int s = 1, int l = 1, int r = n + n - 1){
    if (u <= l && r <= v){
        Max[s] = max(0, Max[s] - val);
        lazy[s] = min(inf, lazy[s] + val);
        return;
    }

    int mid = l + r >> 1;
    if (mid >= u) update(u, v, val, s << 1, l, mid);
    if (mid < v) update(u, v, val, s << 1 | 1, mid + 1, r);

    Max[s] = max(0, max(Max[s << 1], Max[s << 1 | 1]) - lazy[s]);
}

int get(int u, int v, int s = 1, int l = 1, int r = n + n - 1){
    if (u <= l && r <= v) return Max[s];
    if (l > v || r < u) return 0;

    int mid = l + r >> 1;
    int A = get(u, v, s << 1, l, mid);
    int B = get(u, v, s << 1 | 1, mid + 1, r);

    return max(0, max(A, B) - lazy[s]);
}

void process(){
    cin >> n;
    for (int i = 1; i <= n; ++ i)
        cin >> a[i], a[i + n] = i;

    for (int i = 1; i <= n; ++ i)
        cin >> b[i], b[i + n] = i;

    build();

    int ans = inf;

    for (int i = n + n - 2; i >= 1; -- i){
        int r = min(n + n - 1, i + n - 1);
        update(i + 1, r, b[i]);
        if (i <= n) ans = min(ans, get(i, i + n - 1));
    }

    cout << ans;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    process();
    return 0;
}