






"""simple docstring"""



def      _lowerCAmelCase		(							UpperCAmelCase__       :					int,						UpperCAmelCase__       :					int      )		->int:
						return int((input_a, input_a).count(1      ) != 0      )




def      _lowerCAmelCase		(							)		->None:
						assert or_gate(0,						0      ) == 0
						assert or_gate(0,						1      ) == 1
						assert or_gate(1,						0      ) == 1
						assert or_gate(1,						1      ) == 1


if __name__ == "__main__":
						print(or_gate(0, 1))
						print(or_gate(1, 0))
						print(or_gate(0, 0))
						print(or_gate(1, 1))














"""simple docstring"""



def      _lowerCAmelCase		(							UpperCAmelCase__       :					str,						UpperCAmelCase__       :					List[Any]      )		->List[Any]:
						A__						:  Union[str, Any]		  =  [1]
						for i in range(2,						UpperCAmelCase__      ):
												factorials.append(factorials[-1] * i      )
						assert 0 <= k < factorials[-1] * n, "k out of bounds"

						A__						:  Optional[int]		  =  []
						A__						:  List[str]		  =  list(range(UpperCAmelCase__      )      )

						# Find permutation
						while factorials:
												A__						:  Optional[int]		  =  factorials.pop()
												A__  ,  A__						:  Optional[int]		  =  divmod(UpperCAmelCase__,						UpperCAmelCase__      )
												permutation.append(elements[number]      )
												elements.remove(elements[number]      )
						permutation.append(elements[0]      )

						return permutation


if __name__ == "__main__":
						import doctest

						doctest.testmod()






