n=int(input())

connection=[[] for i in range(n)]
for i in range(n):
  x=bin(i+1).count('1')
  if i-x>=0:
    connection[i].append(i-x)
  if i+x<n:
    connection[i].append(i+x)

def bfs(v):
  distance=[-1]*n
  distance[v]=0
  next=connection[v]
  next2=set()
  visited=[-1]*n
  visited[v]=1
  visitct=1
  ct=0
  while len(next)!=0 and visitct!=n:
    ct+=1
    for i in range(len(next)):
      if visited[next[i]]==-1:
        distance[next[i]]=ct
        visited[next[i]]=1
        visitct+=1
        for j in range(len(connection[next[i]])):
          if visited[connection[next[i]][j]]==-1:
            next2.add(connection[next[i]][j])
    next=list(next2)
    next2=set()
  return distance

if bfs(0)[-1]==-1:
  print(-1)
else:
  print(bfs(0)[-1]+1)