def max_subset_sum(a1, a2):
    n = len(a1)
    if n == 0:
        return 0

    dp = [0] * n
    dp[0] = max(a1[0], a2[0], 0)

    if n == 1:
        return dp[0]

    dp[1] = max(dp[0], a1[1], a2[1])

    for i in range(2, n):
        dp[i] = max(dp[i - 1], max(a1[i], a2[i]) + dp[i - 2])

    return dp[n - 1]


a1 = [1, 5, 3, 21234]
a2 = [-4509, 200, 3, 40]

print(max_subset_sum(a1, a2))