from collections import deque


def bfs(start, goal):
    queue = deque([])
    visited = set()
    queue.append([start])

    while queue:
        # print("="*30)
        # print(queue)
        v = queue.popleft()

        # print("{} checking...".format(v[-1]))

        if v[-1] == goal:
            return v
            exit()

        for x in g[v[-1]]:
            if x in visited:
                # print("{} is already visited.".format(x))
                pass
            if x not in visited:
                # print("{} is hajimete.".format(x))
                # print(v + [x])
                queue.append(v + [x])
                visited.add(v[-1])


N = int(input())
m = []
g = {}
for i in range(1, N + 1):
    m.append("{:b}".format(i).count("1"))
for i in range(len(m)):
    l = []
    if i + m[i] < len(m):
        l.append(i + m[i])
    if i - m[i] >= 0:
        l.append(i - m[i])
    g[i] = l

path = bfs(0, N - 1)
if path:
    print(len(path))
else:
    print("-1")