





'''simple docstring'''




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






def 	_lowerCAmelCase      (  )					->					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()






'''simple docstring'''




import itertools
import math






def 	_lowerCAmelCase      (  __snake_case  :			int      )					->					bool:

     if 1 < number < 4:
          # 2 and 3 are primes
          return True
     elif number < 2 or number % 2 == 0 or number % 3 == 0:
          # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
          return False

     # All primes number are in format of 6k +/- 1
     for i in range(5			,							int(math.sqrt(__snake_case      ) + 1      )			,							6      ):
          if number % i == 0 or number % (i + 2) == 0:
               return False
     return True






def 	_lowerCAmelCase      (  )					->					List[Any]:
     __A						:			Optional[Any]								=	2
     while True:
          if is_prime(__snake_case      ):
               yield num
          num += 1






def 	_lowerCAmelCase      (  __snake_case  :			int = 1_00_01      )					->					int:
     return next(itertools.islice(prime_generator()			,							nth - 1			,							__snake_case      )      )


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