#!/usr/bin/env python3
import sys
input = sys.stdin.readline
import heapq
INF = 10**9

n = int(input())

edge = [[] for _ in range(n)]
for i in range(1, n+1):
    step = bin(i).count("1")
    if i - step > 0:
        edge[i-1].append(i-step-1)
    if i + step <= n:
        edge[i-1].append(i+step-1)

class Dijkstra:
    def __init__(self, adj):
        self.adj = adj
        self.dist = [INF] * len(adj)
        self.q = []

    def calc(self, start):
        self.dist[start] = 0
        heapq.heappush(self.q, (0, start))
        while len(self.q) != 0:
            prov_cost, src = heapq.heappop(self.q)
            if self.dist[src] < prov_cost:
                continue
            for dest in self.adj[src]:
                if self.dist[dest] > self.dist[src] + 1:
                    self.dist[dest] = self.dist[src] + 1
                    heapq.heappush(self.q, (self.dist[dest], dest))
        return self.dist

DIJK = Dijkstra(edge)
DIJK.calc(0)
if DIJK.dist[-1] == INF:
    print(-1)
else:
    print(DIJK.dist[-1] + 1)