#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define mem(a,b) memset((a),(b),sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
#define int long long

const int maxn = 1e5 + 10;

int n, dp[1010][10010], a[1010], b[1010], pre[1010], min_ans = INF;

bool dfs(int pos, int gap, int used) {
    // if (pos == n) return 1;
    if (pos > n) return 0;
    if(gap > min_ans) return 1;
    // if (~dp[pos][gap]) return dp[pos][gap];
    bool ans = 0;
    bool nowans = dfs(pos + 1, max(gap, used + b[pos] - pre[pos - 1]), used + b[pos]);
    ans = ans || nowans;
    if (nowans || pos == n) {
        dp[pos][max(gap, used + b[pos] - pre[pos - 1])] = 1;
    }
    nowans = dfs(pos + 2, max(gap, used + b[pos] - pre[pos - 1]), used + b[pos]);
    ans = ans || nowans;
    if (nowans || pos == n) {
        dp[pos][max(gap, used + b[pos] - pre[pos - 1])] = 1;
    }
    if(pos == n) {min_ans = min(min_ans, max(gap, used + b[pos] - pre[pos - 1])) ;return 1;}
    else return ans;
}

void solve() {
    memset(dp, -1, sizeof dp);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        pre[i] = pre[i - 1] + a[i];
    }
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
    }
    dfs(1, 0, 0);
    int ans = 0;
    // for (int i = 0; i <= 100; i++) {
    //     cerr << dp[n][i] << ' ';
    // }
    // cerr << '\n';
    // for (int i = 0; i <= 10000; i++) {
    //     if (dp[n][i] == 1) {
    //         ans = i;
    //         break;
    //     }
    // }
    cout << pre[n] + min_ans << '\n';
}

signed main(){
    // io;
    int T = 1;
    //cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}