using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        var b = NList;
        var tree = new List<int>[1_000_001];
        for (var i = 0; i < tree.Length; ++i) tree[i] = new List<int>();
        for (var i = 0; i < n; ++i)
        {
            tree[a[i]].Add(a[i] + b[i]);
        }
        var visited = new bool[tree.Length];
        visited[1] = true;
        var ans = 1;
        for (var i = 1; i < tree.Length; ++i)
        {
            if (!visited[i]) continue;
            foreach (var next in tree[i])
            {
                visited[next] = true;
                ans = Math.Max(ans, next);
            }
        }
        WriteLine(ans);
    }
}