Programmers 예상 대진표

def solution(n, a, b):
    answer = 0
    while a != b:
        answer += 1
        a = (a + 1) // 2
        b = (b + 1) // 2
    return answer

def solution(n,a,b):
    return ((a-1)^(b-1)).bit_length()