def dfs(now,count,path,N):
	if now == N:return count
	if str(bin(now)).count('1') == 0:
		return 10000 + 1
	next1 = now + str(bin(now)).count('1')
	next2 = now - str(bin(now)).count('1')
	ret1,ret2 = 10000 + 1,10000 + 1
	if not(next1 > N or path[next1 - 1]):
		path[next1 - 1] = True
		ret1 = min(ret1,dfs(now + str(bin(now)).count('1'),count + 1,path,N))
		path[next1 - 1] = False
	if not(next2 <= 0 or path[next2 - 1]):
		path[next2 - 1] = True
		ret2 = min(ret2,dfs(now - str(bin(now)).count('1'),count + 1,path,N))
		path[next2 - 1] = False
	return min(ret1,ret2)
N = int(raw_input())
path = [False for i in range(N)]
path[0] = True
ans = dfs(1,1,path,N)
if ans == 10000 + 1:
	print -1
else:
	print ans