def max_sum_rectangular_grid(grid, n):
    if not grid or n <= 0:
        return 0

    values = [max(grid[0][i], grid[1][i]) for i in range(n)]

    if n == 1:
        return values[0]

    prev_two = 0
    prev_one = values[0]

    for i in range(1, n):
        current = max(prev_one, prev_two + values[i])
        prev_two = prev_one
        prev_one = current

    return prev_one