#include<bits/stdc++.h>
using namespace std;
int n;
int a[1005] , b[1005];
int f[3][10005];
void upd(int &x,int y)
{
    x = min(x , y);
}
int main()
{
   // freopen("in.txt","r",stdin);
    ios::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0);
    cin >> n;
    for(int i = 1;i <= n;i++) cin >> a[i];
    for(int i = 1;i <= n;i++) {cin >> b[i]; a[i] += a[i - 1];}
    int cur = 0;
    memset(f,127,sizeof(f));
    f[0][0] = 0;
    int s = 0;
    for(int i = 0;i < n;i++) {
        for(int j = 0;j <= s;j++) {
          //  printf("%d %d  ,. %d\n",i,j,f[cur][j]);
            upd(f[(cur + 1) %3][j + b[i + 1]] , max(f[cur][j] , j + b[i + 1] - a[i]) ) ;
            if(i + 2 <= n) upd(f[(cur + 2) % 3][j + b[i + 2]] , max(f[cur][j] , j + b[i + 2] - a[i + 1]));
        }
        s += b[i + 1];
        memset(f[cur] , 127 , sizeof(f[cur]));
        cur = (cur + 1) % 3;
    }
    s += b[n];
    int ans = 1e9;
    for(int j = 0 ; j <= s;j++) ans = min(ans , f[cur][j]);
    cout << a[n] + ans;
    return 0;
}