[SWEA] 배열 최소 합

def dfs(index, Sum):
    global min_num
    if index == N:
        if min_num > Sum:
            min_num = Sum
            return
    for i in range(N):
        if visited[i] != 1:
            visited[i] = 1
            Sum += arr[index][i]
            index += 1
            dfs(index, Sum)
            index -= 1
            visited[i] = 0
            Sum -= arr[index][i]

T = int(input())
for TC in range(T):
    N = int(input())
    arr = [list(map(int, input().split())) for _ in range(N)]
    visited = [0]*N
    min_num = 9999999
    dfs(0, 0)
    print('#{} {}'.format(TC+1, min_num))