import math
def bitcount(n):
    cnt=0
    while n!=0:
        cnt+=n%2
        n=math.floor(n/2)
    return cnt
N=int(input())
cnt=2
cntF=False
flag=[False for i in range(N+1)]
flag[1]=True
stack=[1]
p=0
while len(stack)!=0 and p!=N:
    p = stack.pop(0)
    up=p+bitcount(p)
    down=p-bitcount(p)
    if up<=N and flag[up]==False:
        stack.append(up)
        flag[up]=True
        cntF=True
        if up==N:
            break
    if down>=1 and down<=N and flag[down]==False:
        stack.append(down)
        flag[down]=True
        cntF=True
        if down == N:
            break
    if cntF:
        cnt+=1
        cntF=False
if up == N or down == N:
    print(cnt)
else:
    print(-1)