#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
#define mp make_pair
#define eb emplace_back
#define pb push_back
typedef pair<int,int> pii;

const int mxt = 1e5;

int dp[1005][mxt + 5][2];
int a[1005],b[1005];


int32_t main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=n;i++)cin>>b[i];
    
    int ans=1e18;
    
    for(int j=0;j<=mxt;j++)dp[0][j][0]=dp[0][j][1]=0;
    for(int i=1;i<=n;i++){
        dp[i][0][0] = 1e18;
        dp[i][0][1] = 1e18;
        for(int j=1;j<=mxt;j++){
            dp[i][j][1] = min(dp[i-1][j][0] + a[i], (int)1e18);
            if(j>=b[i]) dp[i][j][0] = max(dp[i-1][j-b[i]][1], j) + a[i];
            else dp[i][j][0] = 1e18;

            dp[i][j][1] = min(dp[i][j][1], dp[i][j][0]);

            if(i==1 || i==n)dp[i][j][1] = dp[i][j][0];//not allowed to skip...

            // cout<<i<<' '<<j<<' '<<dp[i][j][0]<<' '<<dp[i][j][1]<<'\n';
        }
    }

    for(int j=1;j<=mxt;j++){
        ans = min(ans, max(j, dp[n][j][0]));
        ans = min(ans, max(j, dp[n][j][1]));
    }
    cout<<ans<<'\n';
}