#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using mint = atcoder::modint998244353;
using maxt = atcoder::modint1000000007;
vector<ll> Era(int N) {
  vector<ll> ans(0, 0);
  vector<bool> isprime(N + 1, true);
  isprime.at(1) = false;
  for(int i = 1; i <= N; i++) {
    if(isprime.at(i)) {
      ans.push_back(i);
      for(int j = 2 * i; j <= N; j += i) {
        isprime.at(j) = false;
      }
    }
  }
  return ans;
}
ll POW(ll a, int N) {
  if(N == 1) {
    return a;
  }
  ll ans = POW(a, N / 2) * POW(a, N / 2);
  if(N % 2 == 1) {
    ans *= a;
  }
  return ans;
}
//ライブラリここまで

int ans = 0;
vector<vector<int>> To(1000001, vector<int>(0, 0));
vector<bool> seen(1000001, false);
void dfs(int v) {
	ans = max(ans, v);
	seen.at(v) = true;
	for(int next_v : To.at(v)) {
		if(seen.at(next_v)) {
			continue;
		}
		dfs(next_v);
	}
}

int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	for(int &o : A) {
		cin >> o;
	}
	vector<int> B(N);
	for(int &o : B) {
		cin >> o;
	}
	for(int i = 0; i < N; i++) {
		To.at(A.at(i)).push_back(A.at(i) + B.at(i));
	}
	dfs(1);
	cout << ans << endl;
}