


'''simple docstring'''



from functools import reduce

A__						:   Union[str, Any]				=    (
    """73167176531330624919225119674426574742355349194934"""
    """96983520312774506326239578318016984801869478851843"""
    """85861560789112949495459501737958331952853208805511"""
    """12540698747158523863050715693290963295227443043557"""
    """66896648950445244523161731856403098711121722383113"""
    """62229893423380308135336276614282806444486645238749"""
    """30358907296290491560440772390713810515859307960866"""
    """70172427121883998797908792274921901699720888093776"""
    """65727333001053367881220235421809751254540594752243"""
    """52584907711670556013604839586446706324415722155397"""
    """53697817977846174064955149290862569321978468622482"""
    """83972241375657056057490261407972968652414535100474"""
    """82166370484403199890008895243450658541227588666881"""
    """16427171479924442928230863465674813919123162824586"""
    """17866458359124566529476545682848912883142607690042"""
    """24219022671055626321111109370544217506941658960408"""
    """07198403850962455444362981230987879927244284909188"""
    """84580156166097919133875499200524063689912560717606"""
    """05886116467109405077541002256983155200055935729725"""
    """71636269561882670428252483600823257530420752963450"""
)



def      UpperCAmelCase__   (      UpperCAmelCase_       :							str = N				)	->						int:
     return max(
         # mypy cannot properly interpret reduce
         int(reduce(lambda UpperCAmelCase_ ,       UpperCAmelCase_				: str(int(UpperCAmelCase_				) * int(UpperCAmelCase_				)				) ,       n[i : i + 13]				)				)
         for i in range(len(UpperCAmelCase_				) - 12				)				)


if __name__ == "__main__":
      print(f'''{solution() = }''')












'''simple docstring'''


def 						lowerCamelCase__   (				a							):
						__snake_case						 =   int(a							)
						if n_element < 1:
												__snake_case						 =   ValueError('a should be a positive number'							)
												raise my_error

						__snake_case						 =   [1]
						__snake_case ,       __snake_case ,       __snake_case						 =   (0, 0, 0)
						__snake_case						 =   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("""-----------------------------------------------------""")

