N = int(input())

p = [[] for i in range(N + 1)]

done = [99999] * (N + 1)
done[1] = 1
que = [1]

while que != []:
    x = que.pop(-1)
    one = bin(x).count("1")
    fwd = x + one
    bak = x - one

    if 0 < fwd <= N:
        if done[fwd] > done[x] + 1:
            found = True
            done[fwd] = done[x] + 1
            que.append(fwd)
    if 0 < bak <= N:
        if done[bak] > done[x] + 1:
            found = True
            done[bak] = done[x] + 1
            que.append(bak)
    
if done[N] == 99999:
    print(-1)
else:
    print(done[N])