import heapq
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

N = int(input())
dp = [None]*(N+1)  # dp[i]: マスIにたどり着ける最小の手数
dp[1] = 0


def popcount(n):
    return bin(n).count("1")


Q = [[1, 1]]
while Q:
    n, p = heapq.heappop(Q)
    pop = popcount(p)
    if 1 <= p+pop <= N:
        if dp[p+pop] is None:
            dp[p+pop] = dp[p]+1
            heapq.heappush(Q, [n+1, p+pop])
    if 1 <= p-pop <= N:
        if dp[p-pop] is None:
            dp[p-pop] = dp[p]+1
            heapq.heappush(Q, [n+1, p-pop])
if dp[-1] is None:
    print(-1)
else:
    print(dp[-1]+1)