class Solution {
    fun largestIsland(grid: Array<IntArray>): Int {
        val n = grid.size
        val firstLabel = 2
        val sizes = mutableMapOf<Int, Int>()

        fun label(row: Int, col: Int): Int =
            if (row !in 0 until n || col !in 0 until n) 0 else grid[row][col]

        fun conquerIsland(label: Int, row: Int, col: Int): Int {
            val queue = mutableListOf<Pair<Int, Int>>()
            var size = 0
            grid[row][col] = label
            queue.add(Pair(row, col))
            while (queue.isNotEmpty()) {
                val (r, c) = queue.removeAt(0)
                size++
                for (step in steps) {
                    val nextR = r + step.first
                    val nextC = c + step.second
                    if (label(nextR, nextC) == 1) {
                        grid[nextR][nextC] = label
                        queue.add(Pair(nextR, nextC))
                    }
                }
            }
            return size
        }

        fun discoverIslands() {
            var k = firstLabel
            for (row in 0 until n) {
                for (col in 0 until n) {
                    if (grid[row][col] == 1) {
                        val size = conquerIsland(k, row, col)
                        sizes[k] = size
                        k++
                    }
                }
            }
        }

        fun largestCombinedIsland(): Int {
            var maxSize = sizes.getOrDefault(firstLabel, 0)
            for (row in 0 until n) {
                for (col in 0 until n) {
                    if (grid[row][col] == 0) {
                        val neighbors = steps.map { (dr, dc) -> label(row + dr, col + dc) }.toSet()
                        val combinedSize = neighbors.sumOf { label -> sizes.getOrDefault(label, 0) }
                        maxSize = maxOf(combinedSize + 1, maxSize)
                    }
                }
            }
            return maxSize
        }

        discoverIslands()
        return largestCombinedIsland()
    }

    companion object {
        private val steps = arrayOf(Pair(-1, 0), Pair(1, 0), Pair(0, -1), Pair(0, 1))
    }
}

class Solution {
    fun largestIsland(grid: Array<IntArray>): Int {
        val n = grid.size
        val firstLabel = 2
        val sizes = mutableMapOf<Int, Int>()

        fun label(row: Int, col: Int): Int =
            if (row !in 0 until n || col !in 0 until n) 0 else grid[row][col]

        fun conquerIsland(label: Int, row: Int, col: Int): Int {
            val queue = mutableListOf<Pair<Int, Int>>()
            var size = 0
            grid[row][col] = label
            queue.add(Pair(row, col))
            while (queue.isNotEmpty()) {
                val (r, c) = queue.removeAt(0)
                size++
                for (step in steps) {
                    val nextR = r + step.first
                    val nextC = c + step.second
                    if (label(nextR, nextC) == 1) {
                        grid[nextR][nextC] = label
                        queue.add(Pair(nextR, nextC))
                    }
                }
            }
            return size
        }

        fun discoverIslands() {
            var k = firstLabel
            for (row in 0 until n) {
                for (col in 0 until n) {
                    if (grid[row][col] == 1) {
                        val size = conquerIsland(k, row, col)
                        sizes[k] = size
                        k++
                    }
                }
            }
        }

        fun largestCombinedIsland(): Int {
            var maxSize = sizes.getOrDefault(firstLabel, 0)
            for (row in 0 until n) {
                for (col in 0 until n) {
                    if (grid[row][col] == 0) {
                        val neighbors = steps.map { (dr, dc) -> label(row + dr, col + dc) }.toSet()
                        val combinedSize = neighbors.sumOf { label -> sizes.getOrDefault(label, 0) }
                        maxSize = maxOf(combinedSize + 1, maxSize)
                    }
                }
            }
            return maxSize
        }

        discoverIslands()
        return largestCombinedIsland()
    }

    companion object {
        private val steps = arrayOf(Pair(-1, 0), Pair(1, 0), Pair(0, -1), Pair(0, 1))
    }
}
