#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll

const int N = 1e3+10,mo = 1e9+7;

int a[N],b[N];
int prea[N];

int dp[N*10][N];
int vis[N*10][N];//
inline void solve(){
    int n;cin>>n;
    int sum=0;int mins=1e18;
    for(int i=1;i<=n;i++)cin>>a[i],sum+=a[i],prea[i]=prea[i-1]+a[i];
    for(int i=1;i<=n;i++)cin>>b[i];
    vis[b[1]][1]=1;
    for(int t=1;t<=n*10;t++){
        for(int i=1;i<=n;i++){
            int res=0;
            
            if(t>=b[i]&&vis[t-b[i]][i-1])res=max(res,min(prea[i-1],dp[t-b[i]][i-1]+b[i])),vis[t][i]=1;
            if(t>=b[i]&&vis[t-b[i]][i-2]&&i>=2)res=max(res,min(prea[i-1],dp[t-b[i]][i-2]+b[i])),vis[t][i]=1;
            if(!vis[t][i])continue;
            dp[t][i]=res;
            // cerr<<t<<" "<<t<<" "<<i<<" "<<res<<"\n";
            if(i==n)mins=min(mins,t-dp[t][i]);
        }
        
    }




    int ans = sum+mins;
    cout<<ans<<"\n";
}



signed main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int WTN666=1;//cin>>WTN666;
    while(WTN666--){
        solve();
    }
}