#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int N = 1010;
const int M = 10010;
int n, a[N], b[N], sa[N];
int f[N][M];
inline void U(int &x, int y) {
    x = max(x, y);
}
int main() {
    scanf("%d", &n);
    for (int i = 1, sm = 0; i <= n; ++i) {
        scanf("%d", a + i);
        sa[i] = sa[i - 1] + a[i];
    }
    for (int i = 1; i <= n; ++i) scanf("%d", b + i);
    for (int i = 1; i <= n; ++i)
        for (int j = 0; j < M; ++j) 
        f[i][j] = -1;
    f[1][b[1]] = 0;
    for (int i = 1; i <= n; ++i)
        for (int j = 0; j < M; ++j) if (f[i][j] != -1) {
            if (i + 1 <= n) {
                int tm = b[i + 1];
                int nf = min(sa[i], f[i][j] + tm);
                if (j + tm < M) U(f[i + 1][j + tm], nf); 
            }
            if (i + 2 <= n) {
                int tm = b[i + 2];
                int nf = min(sa[i + 1], f[i][j] + tm);
                if (j + tm < M) U(f[i + 2][j + tm], nf); 
            }
        }
    int ans = 1e9;
    for (int i = 0; i < M; ++i) if (f[n][i] != -1) {
        ans = min(ans, i + sa[n] - f[n][i]);
    }
    printf("%d\n", ans);
    return 0;
}