#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#define fast
#else
#define fast cin.tie(0)->sync_with_stdio(0)
#define cerr if(1);else cerr
#define endl '\n'
#endif
#define _ <<' '<<
#define ALL(v) v.begin(),v.end()
#define ft first
#define sd second

using ll = long long;
using ld = long double;
using pii = pair<int,int>;

constexpr int MAXN = 1000;
constexpr int MAXB = 10;
constexpr int MAXT = MAXB * MAXN;

void chmax(auto& a, auto b) {
    if (a < b) a = b;
}

signed main() {
    fast;

    int n;
    cin >> n;
    vector<int> A(n+1), B(n+1);
    for (int i = 0; i < n; i++) cin >> A[i];
    for (int i = 0; i < n; i++) cin >> B[i];

    int T = accumulate(ALL(B), 0);
    vector<vector<int>> dp(n+1, vector<int>(T+1,-1));
    vector<vector<int>> page(n+1, vector<int>(T+1,0));
    vector<vector<bool>> can(n+1, vector<bool>(T+1,false));
    can[0][0] = true;

    for (int i = 0; i < n; i++) {
        for (int t = 0; t < T; t++) if (can[i][t]) {
            int tt = t + B[i];
            for (int ii = i+1; ii <= i+2 and ii <= n; ii++) {
                int rt = B[i] - page[i][t];
                int j = dp[i][t];
                while (rt > 0 and j+1 < ii-1)
                    rt -= A[++j];
                can[ii][tt] = true;
                dp[ii][tt] = j;
                page[ii][tt] = max(-rt, 0);
            }
        }
    }

    for (int i = 0; i <= n; i++) {
        cerr _ "i =" _ i _ endl;
        for (int t = 0; t <= T; t++)
            cerr << dp[i][t] << " \n"[t==T];
        for (int t = 0; t <= T; t++)
            cerr << page[i][t] << " \n"[t==T];
    }

    vector<int> sA(n+1);
    sA[n] = 0;
    for (int i = n; i > 0; i--)
        sA[i-1] = sA[i] + A[i-1];

    int ans = 1e9;
    for (int t = 0; t <= T; t++) if (can[n][t]) {
        int x = t + page[n][t] + sA[dp[n][t]];
        ans = min(ans, x);
        cerr _ t _ x _ page[n][t] _ dp[n][t] _ sA[dp[n][t]] _ endl;
    }
    cout << ans-1 << endl;


    return 0;
}