#include <bits/stdc++.h>

using namespace std;

#define int long long
#define fir first
#define sec second
#define mkp make_pair 
#define pb push_back
#define lep( i, l, r ) for ( int i = ( l ); i <= ( r ); ++ i )
#define rep( i, r, l ) for ( int i = ( r ); i >= ( l ); -- i )

typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;

char _c; bool _f; template < class type > inline void read ( type &x ) {
	_f = 0, x = 0;
	while ( _c = getchar (), !isdigit ( _c ) ) if ( _c == '-' ) _f = 1;
	while ( isdigit ( _c ) ) x = x * 10 + _c - '0', _c = getchar (); if ( _f ) { x = -x; }
}

template < class type > inline void chkmin ( type &x, type y ) { x = ( x <= y ? x : y ); }
template < class type > inline void chkmax ( type &x, type y ) { x = ( x >= y ? x : y ); }

const int N = 1e6 + 5;

int n, ans;
int t[N], a[N], res[N], pre[N];

bool Check () {
  for ( int i = 1; i <= n; i ++ ) {
    pre[i] = pre[i - 1] + res[i];
  }
  for ( int i = 1; i <= n; i ++ ) {
    if ( res[i] ) {
      int l = max ( 1ll, i - t[i] + 1 ), r = min ( n, i + t[i] - 1 );
      if ( pre[r] - pre[l - 1] > 1 ) {
        // cout << i << " " << l << " " << r << '\n';
        // for ( int j = 1; j <= n; j ++ ) {
        //   cout << pre[j] << " ";
        // }
        // cout << '\n';
        // for ( int j = 1; j <= n; j ++ ) {
        //   cout << res[j] << " ";
        // }
        // cout << '\n';
        return false;
      }
    }
  }
  return true;
}

void dfs ( int x, int sum ) {
  if ( x == n + 1 ) {
    if ( Check () ) {
      ans = max ( ans, sum );
    }
    return ;
  }
  res[x] = 1;
  dfs ( x + 1, sum + a[x] );
  res[x] = 0;
  dfs ( x + 1, sum );
}

void Solve () {
  cin >> n;
  for ( int i = 1; i <= n; i ++ ) {
    cin >> t[i];
  }
  for ( int i = 1; i <= n; i ++ ) {
    cin >> a[i];
    a[i] *= t[i];
  }
  dfs ( 1, 0 );
  cout << ans;
}

signed main () {
#ifdef judge
  freopen ( "Code.in", "r", stdin );
  freopen ( "Code.out", "w", stdout );
  freopen ( "Code.err", "w", stderr );
#endif
  Solve ();
	return 0;
}