from collections import deque

def solution(board, moves):
    answer = 0
    moves = deque([move-1 for move in moves])
    stack = []

    while moves:
        found = False
        j = moves.popleft()

        for i in range(len(board)):
            if board[i][j] > 0:
                found=True
                curr = board[i][j]
                board[i][j] = 0
                break


        if stack and found:
            top = stack.pop()
            if curr == top:
                answer+=2
            else:
                stack.append(top)
                stack.append(curr)
        else:
            stack.append(curr)

    return answer