N = int(input())
a = list((bin(i).count("1") for i in range(N+1)))
inf = float("inf")
dp = [inf, 1] + [inf]*(N+100)


def dfs(i, steps):
    if i == N:
        return
    back, forward = i-a[i], i+a[i]
    steps += 1
    if dp[back] > steps:
        dp[back] = steps
        dfs(back, steps)
    if N >= forward and dp[forward] > steps:
        dp[forward] = steps
        dfs(forward, steps)


dfs(1, 1)
print(dp[N] if dp[N] < inf else -1)