






def       snake_case_		(     lowerCAmelCase_       :						int      ):
							__lowercase      :							List[Any]				=     0
							while num > 0:
														digit_sum += num % 10
														num //= 10
							return digit_sum
def       snake_case_		(     lowerCAmelCase_       :						int = 100      ):
							__lowercase      :							str				=     1
							__lowercase      :							Dict				=     2

							for i in range(2       ,       max_n + 1      ):
														__lowercase      :							List[Any]				=     pre_numerator
														__lowercase      :							List[Any]				=     2 * i // 3 if i % 3 == 0 else 1
														__lowercase      :							Dict				=     cur_numerator
														__lowercase      :							Tuple				=     e_cont * pre_numerator + temp

							return sum_digits(lowerCAmelCase_      )


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







def       snake_case_		(     lowerCAmelCase_       :						int       ,       lowerCAmelCase_       :						int      ):
							return int((input_a, input_a).count(0      ) == 0      )
def       snake_case_		(     ):
							assert and_gate(0       ,       0      ) == 0
							assert and_gate(0       ,       1      ) == 0
							assert and_gate(1       ,       0      ) == 0
							assert and_gate(1       ,       1      ) == 1


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