import sys

def bitcnt(N):
	
	cnt = 0
	while N != 0:
		cnt += N % 2
		N = N // 2

	return cnt

def move(loc,N):

	cnt = bitcnt(N)
	mov = loc

	while True:
		
		if cnt == 0:
			return -1

		if cnt + loc < N:
			mov = loc + cnt
			move(loc,N)


N = int(input())

if N < 1 or N > 10000:
	sys.exit()

loc = 1
cnt = 0
x = 1

pos = {}

while True:
	
	cnt = bitcnt(loc)
	#print('loc:'+str(loc))
	#print(pos)
	
	if loc not in pos:
		pos[loc] = 1
	
	if pos[loc] == 0:
		print('-1')
		break

	elif pos[loc] > 0:
		if loc + cnt < N:
			pos[loc] = -1
			loc += cnt
			x += 1
			continue

		elif loc + cnt == N:
			loc += cnt
			x += 1
			print(x)
			break

		else:
			pos[loc] = -1
	else:
		pos[loc] = 0
		loc -= cnt
		x += 1