#include<algorithm>
#include<iostream>
#include<utility>
#include<cstring>
#include<vector>
#include<queue>
#include<set>
#define int long long
#define PB push_back
#define X first
#define Y second
using namespace std;
const int N=1e3+5,MOD=1e9+7;
int A[N]={},B[N]={};
int dp[N][N][10]={};
int vis[N]={};
int n,sum,ans=0x3f3f3f3f;
signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>n;
    memset(dp,0x3f,sizeof(dp));
    dp[0][0][0]=0;
    for(int i=1;i<=n;i++) cin>>A[i];
    for(int i=1;i<=n;i++) cin>>B[i];
    for(int i=1;i<=n;i++){
        sum+=B[i];
        for(int j=0;j<=sum;j++){
            if(j>=B[i]) dp[i][j][1]=max(min(dp[i-1][j-B[i]][0],dp[i-1][j-B[i]][1]),j)+A[i];
            dp[i][j][0]=dp[i-1][j][1]+A[i];
        }
    }
    for(int i=0;i<=sum;i++){
        ans=min(ans,dp[n][i][1]);
    }
    cout<<ans<<"\n";
    return 0;
}