from collections import deque
INF = 10**9
n = int(input())
dist = [INF for _ in range(n + 1)]
dist[1] = 1

que = deque()
que.append(1)
while que:
    v = que.popleft()
    x = bin(v).count('1')
    u = v + x

    if u >= 1 and u <= n:
        if dist[u] > dist[v] + 1:
            que.append(u)
            dist[u] = dist[v] + 1
    u = v - x
    if u >= 1 and u <= n:
        if dist[u] > dist[v] + 1:
            que.append(u)
            dist[u] = dist[v] + 1

ans = dist[n] if dist[n] < INF else -1
print(ans)