int solution(int[][] land) {

int N = land.length;

int[][] dp = new int[N][4];

for (int i = 0; i < 4; i++) {

dp[0][i] = land[0][i];

}

for (int i = 1; i < N; i++) {

dp[i][0] = land[i][0] + Math.max(dp[i - 1][1],Math.max(dp[i - 1][2], dp[i - 1][3]));

dp[i][1] = land[i][1] + Math.max(dp[i - 1][0],Math.max(dp[i - 1][2], dp[i - 1][3]));

dp[i][2] = land[i][2] + Math.max(dp[i - 1][1],Math.max(dp[i - 1][0], dp[i - 1][3]));

dp[i][3] = land[i][3] + Math.max(dp[i - 1][1],Math.max(dp[i - 1][2], dp[i - 1][0]));

}

return Math.max(Math.max(dp[N - 1][0], dp[N - 1][1]), Math.max(dp[N - 1][2], dp[N - 1][3]));

}

}