import math
n=int(input())
r=[[0]*n for _ in [0]*n]
for i in range(n):
	t=bin(i+1).count('1')
	if i+t<n: r[i][i+t]=1
	if i-t>0: r[i][i-t]=1

num=len(r)
u=list(range(num))
d=[math.inf]*num
pns=[-1]*num
d[0]=0

def g(m,d,u):
	s=0
	while 1:
		i=d.index(m,s)
		if i in u: return i
		else: s=i+1

while(len(u)!=0):
	q=math.inf
	for ni in u:
		if q>d[ni]: q=d[ni]
	t=g(q,d,u) 
	u.remove(t)
	for i,rd in enumerate(r[t]):
		if rd!=0:
			if d[i]>(d[t]+rd):
				d[i]=d[t]+rd
				pns[i]=t

dis=d[num-1]
print(-1 if dis>n else dis+1)
			
pn