



from __future__ import annotations






def 					__lowerCAmelCase		(  __lowerCamelCase	:    int | str	)  ->						bool:
					__lowerCAmelCase	   =str(__lowerCamelCase	)
					return n == n[::-1]






def 					__lowerCAmelCase		(  __lowerCamelCase	:    int = 1000000	)  ->						List[str]:
					__lowerCAmelCase	   =0

					for i in range(1				,   __lowerCamelCase	):
										if is_palindrome(__lowerCamelCase	) and is_palindrome(bin(__lowerCamelCase	).split("""b"""	)[1]	):
															total += i
					return total


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









def 					__lowerCAmelCase		(  __lowerCamelCase	:    int	)  ->						list:
					__lowerCAmelCase	   =int(__lowerCamelCase	)
					if n_element < 1:
										__lowerCAmelCase	   =ValueError("""a should be a positive number"""	)
										raise my_error

					__lowerCAmelCase	   =[1]
					__lowerCAmelCase   ,	__lowerCAmelCase   ,	__lowerCAmelCase	   =(0, 0, 0)
					__lowerCAmelCase	   =1
					while index < n_element:
										while hamming_list[i] * 2 <= hamming_list[-1]:
															i += 1
										while hamming_list[j] * 3 <= hamming_list[-1]:
															j += 1
										while hamming_list[k] * 5 <= hamming_list[-1]:
															k += 1
										hamming_list.append(
										    min(hamming_list[i] * 2				,   hamming_list[j] * 3				,   hamming_list[k] * 5	)	)
										index += 1
					return hamming_list


if __name__ == "__main__":
				lowercase_	       =			input('''Enter the last number (nth term) of the Hamming Number Series: ''')
				print('''Formula of Hamming Number Series => 2^i * 3^j * 5^k''')
				lowercase_	       =			hamming(int(n))
				print('''-----------------------------------------------------''')
				print(F"The list with nth numbers is: {hamming_numbers}")
				print('''-----------------------------------------------------''')




