def count(n):
    a=0
    num=str(bin(n))
    ln=len(num)
    for i in range(ln):
        if num[i]=='1':
            a+=1
    return a

def add(n):
    return n+count(n)
def minus(n):
    return n-count(n)

def breadth(N):
    q=[[0]for i in range(10000)]
    mile=[0 for i in range(20000)]
    num=[0 for i in range(2)]
    q[0][0]=1
    mile[1]=1
    i=0
    while q!=None:
        if max(q[i])==0:
            return -1
        if N==1:
            return 1
        for j in range(len(q[i])):
            num[0]=add(q[i][j])
            num[1]=minus(q[i][j])
            for n in num:
                if  mile[n]==0 and n<=N:
                    q[i+1].append(n)
                    mile[n]=1
                    if n==N:
                        return i+1+1
        i+=1
        
        
N=int(input())
print(breadth(N))