# 정답 코드(BFS + 최단경로) from collections import deque T = int(input()) for test_case in range(1, T + 1): n = int(input()) dx = [-1,1,0,0] dy = [0,0,-1,1] area = [list(map(int,(list(input())))) for _ in range(n)] visited = [[False]*n for _ in range(n)] time = [[0]*n for _ in range(n)] def bfs(): visited[0][0] = True queue = deque([(0,0)]) while queue: x, y = queue.popleft() for i in range(4): nx = x ..