
def 			A_			(					lowercase      )     ->							Any:


     """simple docstring"""







     if not isinstance(UpperCamelCase__						, UpperCamelCase__      ) or not all(
         isinstance(UpperCamelCase__						, UpperCamelCase__      ) and item >= 0 for item in citations      ):
          raise ValueError("""The citations should be a list of non negative integers."""      )

     citations.sort()
     UpperCAmelCase_						:    Optional[Any]    					=  len(UpperCamelCase__      )

     for i in range(UpperCamelCase__      ):
          if citations[len_citations - 1 - i] <= i:
               return i

     return len_citations


if __name__ == "__main__":
       import doctest

       doctest.testmod()



"""simple docstring"""







def 			A_			(					lowercase = 99_8001      )     ->							int:


     """simple docstring"""







     for number in range(n - 1						, 9999						, -1      ):
          UpperCAmelCase_						:    Union[str, Any]    					=  str(lowercase      )

          # checks whether 'str_number' is a palindrome.
          if str_number == str_number[::-1]:
               UpperCAmelCase_						:    List[str]    					=  999

               # if 'number' is a product of two 3-digit numbers
               # then number is the answer otherwise fetch next number.
               while divisor != 99:
                    if (number % divisor == 0) and (len(str(number // divisor      )      ) == 3.0):
                         return number
                    divisor -= 1
     raise ValueError("""That number is larger than our acceptable range."""      )


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

