#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//using LL = __int128
#pragma GCC optimize(2)
#define pi pair<ll, ll>
#define N 1111111
ll n, t[N], a[N], b[N], dp[N];
vector<int> g[N];
ll v[N];
int lowbit(int x){
	return x & (-x);
}
void update(int x, ll val){
	for(int i = x ; i <= n ; i += lowbit(x)){
		v[i] = max(v[i], val);
	}
}
ll query(int x){
	ll ans = 0;
	for(int i = x ; i ; i -= lowbit(i)){
		ans = max(ans, v[i]);
	}
	return ans;
}
void debug(){
	for(int i = 1 ; i <= n ; i++){
		cerr << dp[i] << " \n"[i == n];
	}
	for(int i = 1 ; i <= n ; i++){
		cerr << i - t[i] << " \n"[i == n];
	}
}
int main(){
	scanf("%lld", &n);
	for(int i = 1 ; i <= n ; i++){
		scanf("%lld", &t[i]);
	}
	for(int i = 1 ; i <= n ; i++){
		scanf("%lld", &a[i]);
		b[i] = a[i] * t[i];
		t[i] = min(t[i], n);
		if(i + t[i] <= n)
			g[i + t[i]].push_back(i);
	}
	if(n <= 1000){
		for(int i = 1 ; i <= n ; i++){
			dp[i] = b[i];
			for(int j = 1 ; j <= i - t[i] ; j++)
				if(i >= j + t[j])
					dp[i] = max(dp[i], b[i] + dp[j]);
			//cerr << dp[i] << " \n"[i == n];
		}
		printf("%lld", *max_element(dp + 1 , dp + 1 + n));
		return 0;
	}
	for(int i = 1 ; i <= n ; i++){
		for(auto p : g[i]){
			update(p, dp[p]);
		}
		dp[i] = b[i] + max(0ll, query(max(0ll, i - t[i])));
	}
	//debug();
	printf("%lld", *max_element(dp + 1 , dp + 1 + n));
	return 0;
}