def pow2(n):
	ans = 1
	for i in range(0, n):
		ans *= 2
	return ans

def countone(n):
	m = n
	cnt = 0
	while m != 0:
		cnt += m%2
		m /= 2
	return cnt

p = int(raw_input())
print countone(pow2(p)-1)