def get_bitnum(n):
    i = 0
    while n > 0:
        if n % 2 == 1:
            i += 1
        n = n // 2
    return i


def create_bitroute(N):
    bitroute = [get_bitnum(i+1) for i in range (N)]
    return bitroute


def search(bitroute, N):
    history = []
    res = []
    queue = [(0,1)]
    while queue != []:
        hd = queue.pop(0)
        pos = hd[0]
        time = hd[1]
        if pos == N-1:
            res.append(time)
        else:
            history.append(pos)
            bitnum = bitroute[pos]
            posR = pos + bitnum
            posL = pos - bitnum
            time += 1
            RB = not (posR > N-1 or posR in history)
            LB = not (posL < 1 or posL in history)
            if RB and LB:
                queue.append((posR, time))
                queue.append((posL, time))
            elif RB and not LB:
                queue.append((posR, time))
            elif LB and not RB:
                queue.append((posL, time))
            else:
                pass
    return res


def main():
    N = int(input())
    bitroute = create_bitroute(N)
    res = search(bitroute, N)
    if res == []:
        ans = -1
    else:
        ans = min(res)
    print(ans)


main()