from collections import deque

def main():
    N = int(input())
    queue = deque()
    L = [(False, i, 0) for i in range(N)]
    L[0] = (True, 1, 1)
    queue.append(L[0])
    while len(queue) > 0:
        now = queue.popleft()
        if now[1] == N:
            print(now[2])
            exit()
        d = count(now[1])
        if (now[1] - d) > 0 and not L[now[1]-d-1][0]:
            L[now[1]-d-1] = (True, now[1] - d, now[2]+1)
            queue.append(L[now[1]-d-1])
        if (now[1] + d) <= N and not L[now[1]+d-1][0]:
            L[now[1]+d-1] = (True, now[1] + d, now[2]+1)
            queue.append(L[now[1]+d-1])
    print(-1)
        

def count(i):
    return len(list(filter(lambda x: x == '1', str(bin(i))[2:])))


if __name__ == '__main__':
    main()