from collections import deque

class Graph(): #directed
    def __init__(self, n, edge, indexed=1):
        self.n = n
        self.graph = [[] for _ in range(n)]
        self.rev = [[] for _ in range(n)]
        self.deg = [0 for _ in range(n)]
        for e in edge:
            self.graph[e[0] - indexed].append(e[1] - indexed)
            self.rev[e[1] - indexed].append(e[0] - indexed)
            self.deg[e[1] - indexed] += 1

    def BFS(self,s, restore_to=None): #sを始点とした最短経路
        dist = [None for _ in range(self.n)]
        dist[s] = 0
        queue = deque([s])
        prev = [None for _ in range(self.n)]
        while queue:
            node = queue.popleft()
            for adj in self.graph[node]:
                if dist[adj] is not None:
                    continue
                dist[adj] = dist[node] + 1
                queue.append(adj)
        if restore_to is not None:
            path = [restore_to]
            node = restore_to
            while node != s:
                node = prev[node]
                path.append(node)
            return dist, path[::-1]
        return dist

import sys
input = sys.stdin.readline

N = int(input())
E = []

for i in range(1, N + 1):
    count = 0
    for j in range(i.bit_length()):
        if (i >> j) & 1:
            count += 1
    if i - count >= 1:
        E.append((i, i - count))
    if i + count <= N:
        E.append((i, i + count))

g = Graph(N, E)
res = g.BFS(0)[N - 1]

print(res + 1 if res is not None else -1)