完全二叉树节点层次

def solve(n):
    n = int(n)
    level = 1
    while (1 << level) - 1 < n:
        level += 1
    print(level)