import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N = int(input())

E = [[] for _ in range(N + 1)]
for i in range(1, N + 1):
    b = bin(i).count('1')
    if i - b > 0:
        E[i].append(i - b)
    if i + b <= N:
        E[i].append(i + b)

INF = 1 << 30
C = [INF] * (N + 1)
C[1] = 1
dq = deque([1])
while len(dq) > 0:
    v = dq.popleft()
    for d in E[v]:
        if C[d] > C[v] + 1:
            C[d] = C[v] + 1
            dq.append(d)
print(C[N] if C[N] < INF else -1)