import heapq

#edgeには[weight,v]を追加していく
def dijkstra(s,edge):
    #始点sから各頂点への最短距離
    d = [float("inf")] * (n+1)
    used = [True] * (n+1) #True:未確定
    d[s] = 0
    used[s] = False
    edgelist = []
    for e in edge[s]:
        heapq.heappush(edgelist,e)
    while len(edgelist):
        minedge = heapq.heappop(edgelist)
        #まだ使われてない頂点の中から最小の距離のものを探す
        if not used[minedge[1]]:
            continue
        v = minedge[1]
        d[v] = minedge[0]
        used[v] = False
        for e in edge[v]:
            if used[e[1]]:
                heapq.heappush(edgelist,[e[0]+d[v],e[1]])
    return d

def popcount(n):
    ret=0
    for i in range(20):
        if n&(1<<i):
            ret+=1
    return ret

n=int(input())
edges=[[] for _ in range(n+1)]
for v in range(1,n+1):
    pc=popcount(v)
    if v-pc>=1:
        edges[v].append((1,v-pc))
    if v+pc<=n:
        edges[v].append((1,v+pc))
ans=dijkstra(1,edges)
if ans[n]==float('inf'):
    print(-1)
else:
    print(ans[n]+1)