def solution(board, moves):
    answer = 0
    bucket = []

    for m in moves:
        for i in range(len(board[0])):
            if board[i][m - 1] != 0:
                bucket.append(board[i][m - 1])
                board[i][m - 1] = 0
                break

        if len(bucket) >= 2 and bucket[-1] == bucket[-2]:
            answer += 2
            bucket.pop()
            bucket.pop()

    return answer