# 深さ優先探索で解きました
import numpy as np

def dfs(g, v, prev_v):
    previous_vs[v] = prev_v
    
    seen[v] = True
    next_vs = g[v]
    for next_v in next_vs:
        if seen[next_v]:
            continue
        dfs(g, next_v, v)

N = int(input())
lengths = [bin(i).count('1') for i in range(1,N+1)]

g = []
for i, length in enumerate(lengths):
    edges = []
    forward = i+length
    backward = i-length
    if not backward < 0:
        edges.append(backward)
    if not forward > N-1:
        edges.append(forward)
    g.append(edges)

seen = np.zeros_like(lengths, np.bool)
previous_vs = np.full_like(lengths, -1)
dfs(g, 0, -1)

if seen[N-1]:
    count = 1
    previous_v = N-1
    while True:
        previous_v = previous_vs[previous_v]
        count = count + 1
        if previous_v == 0:
            break
    print(count)
else:
    print(-1)