from collections import deque
N = int(input())
dp = [float('inf')] * (N + 1)
dp[1] = 1
que = deque([1])

while que:
    n = que.pop()

    move = bin(n)[2:].count('1')
    if n + move <= N:
        if dp[n + move] == float('inf'):
            dp[n + move] = dp[n] + 1
            que.appendleft(n + move)

    if n - move > 0:
        if dp[n - move] == float('inf'):
            dp[n - move] = dp[n] + 1
            que.appendleft(n - move)

print(dp[N] if dp[N] != float('inf') else -1)