
class       _lowerCAmelCase   :




				def __init__(   self							,							_UpperCamelCase	)							-> None:
							lowerCAmelCase_         =      set_counts
							lowerCAmelCase_         =      max(_UpperCamelCase	)
							lowerCAmelCase_         =      len(_UpperCamelCase	)
							lowerCAmelCase_         =      [1] * num_sets
							lowerCAmelCase_         =      list(range(_UpperCamelCase	)	)




				def 	__a		(   self							,							_UpperCamelCase							,							_UpperCamelCase	)							-> bool:
							lowerCAmelCase_         =      self.get_parent(_UpperCamelCase	)
							lowerCAmelCase_         =      self.get_parent(_UpperCamelCase	)

							if src_parent == dst_parent:
										return False

							if self.ranks[dst_parent] >= self.ranks[src_parent]:
										self.set_counts[dst_parent] += self.set_counts[src_parent]
										lowerCAmelCase_         =      0
										lowerCAmelCase_         =      dst_parent
										if self.ranks[dst_parent] == self.ranks[src_parent]:
													self.ranks[dst_parent] += 1
										lowerCAmelCase_         =      self.set_counts[dst_parent]
							else:
										self.set_counts[src_parent] += self.set_counts[dst_parent]
										lowerCAmelCase_         =      0
										lowerCAmelCase_         =      src_parent
										lowerCAmelCase_         =      self.set_counts[src_parent]

							lowerCAmelCase_         =      max(self.max_set							,							_UpperCamelCase	)
							return True




				def 	__a		(   self							,							_UpperCamelCase	)							-> int:
							if self.parents[disj_set] == disj_set:
										return disj_set
							lowerCAmelCase_         =      self.get_parent(self.parents[disj_set]	)
							return self.parents[disj_set]





from functools import reduce

_A  =	(
    "73167176531330624919225119674426574742355349194934"
    "96983520312774506326239578318016984801869478851843"
    "85861560789112949495459501737958331952853208805511"
    "12540698747158523863050715693290963295227443043557"
    "66896648950445244523161731856403098711121722383113"
    "62229893423380308135336276614282806444486645238749"
    "30358907296290491560440772390713810515859307960866"
    "70172427121883998797908792274921901699720888093776"
    "65727333001053367881220235421809751254540594752243"
    "52584907711670556013604839586446706324415722155397"
    "53697817977846174064955149290862569321978468622482"
    "83972241375657056057490261407972968652414535100474"
    "82166370484403199890008895243450658541227588666881"
    "16427171479924442928230863465674813919123162824586"
    "17866458359124566529476545682848912883142607690042"
    "24219022671055626321111109370544217506941658960408"
    "07198403850962455444362981230987879927244284909188"
    "84580156166097919133875499200524063689912560717606"
    "05886116467109405077541002256983155200055935729725"
    "71636269561882670428252483600823257530420752963450"
)






def   lowerCamelCase__							(							__lowerCAmelCase    :    str = N							):




			"""simple docstring"""


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


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



