def go(target,current,path):
    if current==target:
#        print('DONE!')
        return
#    print('debug',current, Z)
    x=bin(current)[2:].count('1')
    f,b=current+x,current-x
    if 0<f<=N or 0<b<=N:
        if f in Z and b in Z:
            return
        else:
            if 0<f<=N and f not in Z:
                Z.add(f)
                path.append(f)
                go(N,f,path)
                R.append(path)
                if path[-1]==target:return
            if 0<b<=N and b not in Z:
                Z.add(b)
                path.append(b)
                go(N,b,path)
                R.append(path)
                if path[-1]==target:return
    else:
        return

#    f,b=current
    return
    
N=int(input())
A=[x for x in range(1,N+1)]
Z={1}
current=1
path=[1]
R=[]
go(N,current,path)
#print(Z,R)
print(min([len(r) if N in r else -1 for r in R ]))