import queue
import sys
INF = 1000000000

n = int(input())
d = [INF for i in range(n)]
visited=[False for i in range(n)] 
dx = [-1, 1]


def calk_walk(n):
    nn = bin(n)
    count = 0
    for i in range(len(nn)):
        if nn[i] == '1':
            count += 1
    return count


def bfs(p):
    q = queue.Queue()
    q.put(p)
    d[p] = 0

    while not q.empty():
        check = q.get()
        if check == n-1:
            break
        for i in range(2):
            np = check + calk_walk(check+1) * dx[i]
            if 0 <= np and np < n and visited[np] == False:
                q.put(np)
                d[np] = d[check] + 1
                visited[np] = True
    return d[n - 1]

if bfs(0) == INF:
    print(-1)
    sys.exit()
print(bfs(0) + 1)