from collections import deque

def solution(land):
    for i in range(1, len(land)):
        for j in range(0, 4):
            temp = deque(land[i-1])
            del temp[j]
            land[i][j] += max(temp)

    return max(land[len(land)-1])