


def       UpperCamelCase__     (  SCREAMING_SNAKE_CASE__ = 998_001						):
 __lowerCamelCase		:							Dict							=						0
 for i in range(999			,       99			,       -1						):  # 3 digit numbers range from 999 down to 100
  for j in range(999			,       99			,       -1						):
   __lowerCamelCase		:							List[Any]							=						str(i * j						)
   if product_string == product_string[::-1] and i * j < n:
    __lowerCamelCase		:							int							=						max(SCREAMING_SNAKE_CASE__			,       i * j						)
 return answer


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





class        A_					:




      '''simple docstring'''


      def __init__(				self:       Tuple						,      a:       Dict=None				):
       __lowerCamelCase		:							List[Any]							=						data
       __lowerCamelCase		:							Optional[Any]							=						None




      def __repr__(				self:       Optional[int]				):
       __lowerCamelCase		:							Any							=						''
       __lowerCamelCase		:							List[Any]							=						self
       while temp:
        string_rep += F'<{temp.data}> ---> '
        __lowerCamelCase		:							Any							=						temp.next
       string_rep += "<END>"
       return string_rep



def       UpperCamelCase__     (  SCREAMING_SNAKE_CASE__						):

 # if elements_list is empty
 if not elements_list:
  raise Exception('The Elements List is empty'						)

 # Set first element as Head
 __lowerCamelCase		:							Optional[int]							=						Node(elements_list[0]						)
 __lowerCamelCase		:							List[str]							=						head
 # Loop through elements from position 1
 for data in elements_list[1:]:
  __lowerCamelCase		:							str							=						Node(SCREAMING_SNAKE_CASE__						)
  __lowerCamelCase		:							Tuple							=						current.next
 return head


lowercase_           =	[1, 3, 5, 3_2, 4_4, 1_2, 4_3]
print(F"""List: {list_data}""")
print('Creating Linked List from List.')
lowercase_           =	make_linked_list(list_data)
print('Linked List:')



print(linked_list)

