/*
    Name:
    Copyright:
    Author: 不要和 std 命名空间冲突！
    Date: 11/16/2023 11:03:56 AM
    Description:等会造成误差！文件读写即可！
*/
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b)  for (int i = (a); i <= (b); i++)
#define repe(i,a,b) for (int i = (a); i >= (b); i--)
bool Mbe;
inline int read() {
	int ans = 0, f = 1; char ch = getchar();
	for(; ch < '0' || ch > '9'; ch = getchar()) if (ch == '-') f = -f;
	for(; ch >= '0' && ch <= '9'; ch = getchar()) ans = (ans << 3) + (ans << 1) + ch - '0';
	return ans * f;
}
const int mod = 1e9 + 7;
int ksm(int truth, int power) {
	int ans = 1;
	while(power) {
		if(power & 1) ans = 1ll * ans * truth % mod;
		power >>= 1;
		truth = 1ll * truth * truth % mod;
	}
	return ans;
}

const int Z = 1e6 + 5;
int fac[Z], ifac[Z];
void init_fac(int x) {
	for(int i = fac[0] = 1; i <= x; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
	ifac[x] = ksm(fac[x], mod - 2);
	for(int i = x - 1; i >= 0; i--) ifac[i] = 1ll * ifac[i + 1] * (i + 1) % mod;
}

const int N = 1e6 + 1;
int a[N], b[N], n, t, m, maxx = 0;
bool vis[N];
long long dp[N];
long long tr[N << 1]; 
void update(int x, long long val){
	while(x <= maxx) {
		tr[x] = max(tr[x], val);
		x += x & (-x);
	}
}

long long query(int x) {
	long long ans = 0;
	while(x) {
		ans = max(ans, tr[x]);
		x -= x & (-x); 
	}
	return ans;
}
vector<int> num[N];
void mian() {
	n = read(); 
	rep(i,1,n) {
		a[i] = read(), maxx = max(a[i] + i, maxx);
		if(i + a[i] <= n)
			num[i + a[i]].push_back(i);	
	}
	rep(i,1,n) b[i] = read();
	long long ans = 0;
	rep(i,1,n) { // 决策优化？
		int c = num[i].size() - 1;
		for(int j = 0; j <= c; j++) update(num[i][j], dp[num[i][j]]);
//		rep(j,0,num[i].size() - 1) cout << num[i].size() << endl; //
		dp[i] = query(max(0, i - a[i])) + 1ll * b[i] * a[i];
		ans = max(dp[i], ans);
	}
//	ans = query(n); 有的没插入 
	cout << ans << endl;
}

bool Med;
int main(){
//    freopen("A.txt", "r", stdin);
//    freopen(".out", "w", stdout);
	fprintf(stderr, "%.3lf MB\n", (&Med - &Mbe) / 1048576.0);
	int T = 1;
	while(T--) mian();
	cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
	return 0;
}