def oi(): return int(input())
def os(): return input()
def mi(): return list(map(int, input().split()))

# import sys
# input = sys.stdin.readline
# import sys
# sys.setrecursionlimit(10**8)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
input_count = 0

input_count = 0
N = oi()
maps = {i:[] for i in range(1, N + 1)}
for i in range(1, N+1):
    count = 0
    j = i
    while j:
        if j%2==1:
            count += 1
        j //= 2

    if i-count >0:
        maps[i].append((i-count, 1))
    if i+count <=N:
        maps[i].append((i+count,1))
# V: 頂点数
# g[v] = {(w, cost)}:
#     頂点vから遷移可能な頂点(w)とそのコスト(cost)
# r: 始点の頂点
 
from heapq import heappush, heappop
INF = float("inf")
def dijkstra(N, G, s):
    dist = [INF] * N
    que = [(0, s)]
    dist[s] = 0
    while que:
        c, v = heappop(que)
        if dist[v] < c:
            continue
        for t, cost in G[v]:
            if dist[v] + cost < dist[t]:
                dist[t] = dist[v] + cost
                heappush(que, (dist[t], t))
    return dist
dist = dijkstra(N+1, maps, 1)
if dist[N] != INF:
    print(dist[N]+1)
else:
    print(-1)