#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<int(n); ++i)
#define repll(i,m,n) for(ll i=m; i<ll(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi first
#define se second

template<typename T> bool chmin(T& a, T b){ if(a > b){a = b; return true;} return false; }
template<typename T> bool chmax(T& a, T b){ if(a < b){a = b; return true;} return false; }

template<typename T> T gcd(T a, T b){ return a % b ? gcd(b, a % b) : b; }
template<typename T> T lcm(T a, T b){ return a / gcd(a, b) * b; }

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;
    
    vector<int> A(N), B(N);
    rep(i, 0, N) cin >> A[i];
    rep(i, 0, N) cin >> B[i];

    const int MAX = 1000100;
    vector<vector<int>> G(MAX);
    rep(i, 0, N){
        G[A[i]].push_back(A[i] + B[i]);
    }

    vector<int> dist(MAX, -1);
    dist[1] = 0;
    queue<int> q;
    q.push(1);

    while(q.size()){
        int v = q.front();
        q.pop();

        for(int to : G[v]){
            if(dist[to] == -1){
                dist[to] = dist[v] + 1;
                q.push(to);
            }
        }
    }

    for(int i = MAX - 1; i > 0; --i){
        if(dist[i] != -1){
            cout << i << endl;
            return 0;
        }
    }
}