


def 						_lowerCAmelCase							(     _lowerCAmelCase = 1000			)    ->						int:


						'''simple docstring'''






						__snake_case		,       __snake_case				=		1, 1
						__snake_case				=		2
						while True:
												__snake_case				=		0
												__snake_case				=		fa + fa
												__snake_case		,       __snake_case				=		fa, f
												index += 1
												for _ in str(_lowerCAmelCase			):
																		i += 1
												if i == n:
																		break
						return index


if __name__ == "__main__":
	print(solution(int(str(input()).strip())))









def 						_lowerCAmelCase							(     _lowerCAmelCase = 1000			)    ->						int:


						'''simple docstring'''






						__snake_case				=		2**power
						__snake_case				=		str(_lowerCAmelCase			)
						__snake_case				=		list(_lowerCAmelCase			)
						__snake_case				=		0

						for i in list_num:
												sum_of_num += int(_lowerCAmelCase			)

						return sum_of_num


if __name__ == "__main__":
	A				:       Optional[Any]      =  int(input('Enter the power of 2: ').strip())
	print('2 ^ ', power, ' = ', 2**power)
	A				:       List[Any]      =  solution(power)
	print('Sum of the digits is: ', result)





