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

#sys.setrecursionlimit(10 ** 9)
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
ml = lambda: map(str, input().split())
li = lambda: list(mi())
li_st = lambda: list(map(str, input().split()))
lli = lambda n: [li() for _ in range(n)]
mod = 998244353

N = ii()
check = [0] * (2*N)
q = deque()

def bit_num(num):
    ans = 0
    while(num > 0):
        if num % 2 == 1:
            ans += 1
        num //= 2

    return ans

q.append((1,1))
check[1] = 1

while(q):
    now,times = q.popleft()
    num = bit_num(now)
    if now - num > 0:
        if check[now-num] == 0:
            q.append((now-num,times+1))
            check[now-num] = times+1
    if now + num <= N:
        if check[now+num] == 0:
            q.append((now+num,times+1))
            check[now+num] = times+1

    times += 1

print(check[N] if check[N] != 0 else -1)