from collections import deque N = int(input()) que = deque([]) now = 1 que.append(now) visited = [False for i in range(N+1)] step = [-1 for i in range(N+1)] visited[1] = True step[1] = 1 step_count = 1 while len(que) > 0 and now != N: now = que.popleft() step_count += step[now] + 1 step_width = bin(now).count("1") next_f = now + step_width next_b = now - step_width if next_f <= N and visited[next_f] is False: que.append(next_f) visited[next_f] = True step[next_f] = step_count if next_b >= 1 and visited[next_b] is False: que.append(next_b) visited[next_b] = True step[next_b] = step_count if now == N: print(step[N]) else: print(-1)