






def 						snake_case      (UpperCAmelCase__ = 9_9_8_0_0_1						) ->       int:
  UpperCamelCase_:      int					   =       0
  for i in range(9_9_9			,					9_9			,					-1						):  # 3 digit numbers range from 999 down to 100
    for j in range(9_9_9			,					9_9			,					-1						):
      UpperCamelCase_:      List[Any]					   =       str(i * j						)
      if product_string == product_string[::-1] and i * j < n:
        UpperCamelCase_:      Dict					   =       max(UpperCAmelCase__			,					i * j						)
  return answer


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







from math import factorial

def 						snake_case      (UpperCAmelCase__			,					UpperCAmelCase__						) ->       Dict:
  return factorial(UpperCAmelCase__						) / (factorial(UpperCAmelCase__						) * factorial(n - r						))

def 						snake_case      () ->       Optional[Any]:
  UpperCamelCase_:      int					   =       0

  for i in range(1			,					1_0_1						):
    for j in range(1			,					i + 1						):
      if combinations(UpperCAmelCase__			,					UpperCAmelCase__						) > 1E6:
        total += 1
  return total


if __name__ == "__main__":
   print(solution())