





def 	A_       (  _lowerCAmelCase = 1							,     _lowerCAmelCase = 1000  )		->				List[Any]:
 UpperCamelCase			:      Optional[int] 			=     1
 UpperCamelCase			:      List[Any] 			=     0

 for divide_by_number in range(snake_case_							,     digit + 1  ):
  UpperCamelCase			:      list[int] 			=     []
  UpperCamelCase			:      Any 			=     numerator
  for _ in range(1							,     digit + 1  ):
   if now_divide in has_been_divided:
    if longest_list_length < len(snake_case_  ):
     UpperCamelCase			:      Optional[Any] 			=     len(snake_case_  )
     UpperCamelCase			:      Optional[Any] 			=     divide_by_number
   else:
    has_been_divided.append(snake_case_  )
    UpperCamelCase			:      Tuple 			=     now_divide * 10 % divide_by_number

 return the_digit


# Tests
if __name__ == "__main__":
    import doctest

    doctest.testmod()









def 	A_       (  _lowerCAmelCase							,     _lowerCAmelCase  )		->				int:
 return int(input_a == input_a == 0  )



def 	A_       (  )		->				None:
 print("Truth Table of NOR Gate:"  )
 print("|   Input 1   |  Input 2  | Output |"  )
 print(F"""|      0      |    0      |  {nor_gate(0							,     0  )}     |"""  )
 print(F"""|      0      |    1      |  {nor_gate(0							,     1  )}     |"""  )
 print(F"""|      1      |    0      |  {nor_gate(1							,     0  )}     |"""  )
 print(F"""|      1      |    1      |  {nor_gate(1							,     1  )}     |"""  )


if __name__ == "__main__":
    import doctest

    doctest.testmod()
    main()
