from collections import deque
def bit(n):
    cnt=0
    while n:
        cnt+=n%2
        n=n//2
    return cnt
def main():
    N=int(input())
    adj=[[] for i in range(N+1)]
    flag=[False]*(N+1)
    flag[1]=True
    queue=deque()
    queuelen=1
    deepness=2
    deepnessflag=False
    solved=False
    queue.appendleft(1)
    result=[]
    for i in range(N+1):
        if  N >= i+bit(i) and i+bit(i)>0:
            adj[i].append(i+bit(i))
        if N>=i-bit(i) and i-bit(i)>0:
            adj[i].append(i-bit(i))
    #print(adj)

    if N==1:
        print(1)
    else:

        while queuelen!=0 and not solved:
            if deepnessflag:
                deepnessflag=False
                deepness+=1
                #print("深さの増加")
            v=queue.pop()
            queuelen-=1
            for u in adj[v]:
                if u == N:
                    solved=True
                if flag[u]==False:
                    flag[u]=True
                    queue.appendleft(u)
                    queuelen+=1
                    #print(u,"を発見",deepness)
                    deepnessflag=True
                    
        if solved:
            print(deepness)
        else:
            print(-1)

main()