from collections import deque
N = int(input())
dist = [0] * (N + 1)
visited = [False] * (N + 1)

q = deque()
q.append(1)
visited[1] = True
while q:
    x = q.popleft()
    p = x.bit_count()
    if x + p <= N and not visited[x + p]:
        visited[x + p] = True
        dist[x + p] = dist[x] + 1
        q.append(x + p)
    if x - p > 0 and not visited[x - p]:
        visited[x - p] = True
        dist[x - p] = dist[x] + 1
        q.append(x - p)
print(dist[N]+1 if visited[N] else -1)