import numpy as np

N = int(input())

def get_bit_sum(num):
    return bin(num).count("1")

visited = np.zeros((N,)).astype(bool)
min_value = np.zeros((N,)) + 1e10
pre_visited = visited.copy()
visited[0] = 1
min_value[0] = 1

while np.sum(visited^pre_visited)>0:
    arg = np.argwhere(pre_visited^visited).reshape(-1)
    move = np.array([get_bit_sum(i) for i in arg+1])
    move = np.concatenate([move,-move])
    arg = np.concatenate([arg,arg])
    min_values = min_value[arg]+1
    for i in range(arg.shape[0]):
        position = arg[i]+move[i]
        if position<1 or position>N-1:
            continue
        min_value[position] = min(min_values[i],min_value[position])
    pre_visited = visited.copy()
    visited = min_value < 1e10
output = min_value[-1] if min_value[-1]<1e10 else -1
print(int(output))