
def     UpperCamelCase      (					__lowerCamelCase  :				Any       ,      __lowerCamelCase  :				int					):
       snake_case :     Any           =   1
       while b > 0:
              if b & 1:
                     res *= a

              a *= a
              b >>= 1

       return res


def     UpperCamelCase      (					__lowerCamelCase  :				List[Any]       ,      __lowerCamelCase  :				List[Any]       ,      __lowerCamelCase  :				Dict					):
       snake_case :     Tuple           =   1
       while b > 0:
              if b & 1:
                     snake_case :     Union[str, Any]           =   ((res % c) * (a % c)) % c

              a *= a
              b >>= 1

       return res







def     UpperCamelCase      (					__lowerCamelCase  :				int = 998001					):
       snake_case :     Optional[Any]           =   0
       for i in range(999       ,      99       ,      -1					):  # 3 digit numbers range from 999 down to 100
              for j in range(999       ,      99       ,      -1					):
                     snake_case :     Tuple           =   str(i * j					)
                     if product_string == product_string[::-1] and i * j < n:
                            snake_case :     str           =   max(__lowerCamelCase       ,      i * j					)
       return answer


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





